./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5b36d44f 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/uthash-2.0.2/uthash_BER_test3-1.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 eb2eb63835edf753d5a467feb7a4cdd6d105155177d7d0cab8bf29c1b74dbaf6 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5b36d44 [2021-11-07 20:54:04,899 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 20:54:04,901 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 20:54:04,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 20:54:04,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 20:54:04,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 20:54:04,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 20:54:04,966 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 20:54:04,967 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 20:54:04,970 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 20:54:04,971 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 20:54:04,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 20:54:04,972 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 20:54:04,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 20:54:04,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 20:54:04,978 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 20:54:04,979 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 20:54:04,980 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 20:54:04,983 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 20:54:04,988 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 20:54:04,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 20:54:04,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 20:54:04,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 20:54:04,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 20:54:04,997 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 20:54:04,997 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 20:54:04,997 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 20:54:04,999 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 20:54:04,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 20:54:05,000 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 20:54:05,000 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 20:54:05,001 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 20:54:05,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 20:54:05,002 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 20:54:05,003 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 20:54:05,003 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 20:54:05,004 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 20:54:05,004 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 20:54:05,004 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 20:54:05,005 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 20:54:05,005 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 20:54:05,006 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-07 20:54:05,031 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 20:54:05,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 20:54:05,032 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 20:54:05,032 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 20:54:05,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 20:54:05,033 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 20:54:05,033 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 20:54:05,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 20:54:05,034 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 20:54:05,034 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 20:54:05,035 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 20:54:05,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 20:54:05,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 20:54:05,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 20:54:05,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 20:54:05,035 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 20:54:05,035 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 20:54:05,036 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 20:54:05,036 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 20:54:05,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 20:54:05,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 20:54:05,040 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 20:54:05,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 20:54:05,041 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 20:54:05,041 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 20:54:05,041 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 20:54:05,041 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-07 20:54:05,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 20:54:05,043 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-07 20:54:05,043 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-07 20:54:05,043 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 20:54:05,043 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 20:54:05,043 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eb2eb63835edf753d5a467feb7a4cdd6d105155177d7d0cab8bf29c1b74dbaf6 [2021-11-07 20:54:05,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 20:54:05,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 20:54:05,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 20:54:05,249 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 20:54:05,249 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 20:54:05,250 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i [2021-11-07 20:54:05,311 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed8ca1b8d/cd8899478b9b4cd1aa3a7032fd0bd6a5/FLAG2c0c4e3f4 [2021-11-07 20:54:05,770 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 20:54:05,771 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i [2021-11-07 20:54:05,795 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed8ca1b8d/cd8899478b9b4cd1aa3a7032fd0bd6a5/FLAG2c0c4e3f4 [2021-11-07 20:54:05,812 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed8ca1b8d/cd8899478b9b4cd1aa3a7032fd0bd6a5 [2021-11-07 20:54:05,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 20:54:05,815 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 20:54:05,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 20:54:05,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 20:54:05,823 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 20:54:05,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:54:05" (1/1) ... [2021-11-07 20:54:05,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f26360c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:54:05, skipping insertion in model container [2021-11-07 20:54:05,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:54:05" (1/1) ... [2021-11-07 20:54:05,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 20:54:05,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 20:54:06,170 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i[33021,33034] [2021-11-07 20:54:06,234 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i[44590,44603] [2021-11-07 20:54:06,239 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 20:54:06,246 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 20:54:06,284 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i[33021,33034] [2021-11-07 20:54:06,353 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i[44590,44603] [2021-11-07 20:54:06,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 20:54:06,386 INFO L208 MainTranslator]: Completed translation [2021-11-07 20:54:06,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:54:06 WrapperNode [2021-11-07 20:54:06,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 20:54:06,388 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 20:54:06,388 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 20:54:06,388 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 20:54:06,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:54:06" (1/1) ... [2021-11-07 20:54:06,426 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:54:06" (1/1) ... [2021-11-07 20:54:06,486 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 20:54:06,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 20:54:06,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 20:54:06,491 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 20:54:06,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:54:06" (1/1) ... [2021-11-07 20:54:06,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:54:06" (1/1) ... [2021-11-07 20:54:06,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:54:06" (1/1) ... [2021-11-07 20:54:06,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:54:06" (1/1) ... [2021-11-07 20:54:06,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:54:06" (1/1) ... [2021-11-07 20:54:06,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:54:06" (1/1) ... [2021-11-07 20:54:06,544 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:54:06" (1/1) ... [2021-11-07 20:54:06,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 20:54:06,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 20:54:06,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 20:54:06,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 20:54:06,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:54:06" (1/1) ... [2021-11-07 20:54:06,562 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 20:54:06,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 20:54:06,598 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 20:54:06,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 20:54:06,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-07 20:54:06,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 20:54:06,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 20:54:06,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 20:54:06,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 20:54:06,639 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-07 20:54:06,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 20:54:06,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 20:54:06,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 20:54:06,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 20:54:06,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 20:54:07,402 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 20:54:07,402 INFO L299 CfgBuilder]: Removed 85 assume(true) statements. [2021-11-07 20:54:07,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:54:07 BoogieIcfgContainer [2021-11-07 20:54:07,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 20:54:07,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 20:54:07,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 20:54:07,408 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 20:54:07,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:54:05" (1/3) ... [2021-11-07 20:54:07,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27596f5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:54:07, skipping insertion in model container [2021-11-07 20:54:07,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:54:06" (2/3) ... [2021-11-07 20:54:07,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27596f5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:54:07, skipping insertion in model container [2021-11-07 20:54:07,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:54:07" (3/3) ... [2021-11-07 20:54:07,412 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_BER_test3-1.i [2021-11-07 20:54:07,416 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 20:54:07,417 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-11-07 20:54:07,449 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 20:54:07,454 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 20:54:07,454 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-07 20:54:07,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 202 states, 195 states have (on average 1.7230769230769232) internal successors, (336), 201 states have internal predecessors, (336), 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) [2021-11-07 20:54:07,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 20:54:07,479 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:54:07,480 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:54:07,480 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-07 20:54:07,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:54:07,484 INFO L85 PathProgramCache]: Analyzing trace with hash 239232295, now seen corresponding path program 1 times [2021-11-07 20:54:07,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 20:54:07,491 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442530042] [2021-11-07 20:54:07,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:54:07,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 20:54:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:54:07,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:54:07,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 20:54:07,613 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442530042] [2021-11-07 20:54:07,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442530042] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 20:54:07,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:54:07,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 20:54:07,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911118307] [2021-11-07 20:54:07,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 20:54:07,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-07 20:54:07,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 20:54:07,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-07 20:54:07,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 20:54:07,645 INFO L87 Difference]: Start difference. First operand has 202 states, 195 states have (on average 1.7230769230769232) internal successors, (336), 201 states have internal predecessors, (336), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2021-11-07 20:54:07,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:54:07,693 INFO L93 Difference]: Finished difference Result 402 states and 670 transitions. [2021-11-07 20:54:07,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-07 20:54:07,695 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2021-11-07 20:54:07,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:54:07,706 INFO L225 Difference]: With dead ends: 402 [2021-11-07 20:54:07,706 INFO L226 Difference]: Without dead ends: 198 [2021-11-07 20:54:07,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.04ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 20:54:07,713 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.53ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-07 20:54:07,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 4.53ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-07 20:54:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-07 20:54:07,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-11-07 20:54:07,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 192 states have (on average 1.3489583333333333) internal successors, (259), 197 states have internal predecessors, (259), 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) [2021-11-07 20:54:07,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 259 transitions. [2021-11-07 20:54:07,763 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 259 transitions. Word has length 9 [2021-11-07 20:54:07,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:54:07,763 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 259 transitions. [2021-11-07 20:54:07,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2021-11-07 20:54:07,764 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 259 transitions. [2021-11-07 20:54:07,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 20:54:07,764 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:54:07,764 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:54:07,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 20:54:07,765 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-07 20:54:07,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:54:07,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1042319138, now seen corresponding path program 1 times [2021-11-07 20:54:07,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 20:54:07,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753568948] [2021-11-07 20:54:07,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:54:07,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 20:54:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:54:07,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:54:07,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 20:54:07,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753568948] [2021-11-07 20:54:07,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753568948] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 20:54:07,852 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:54:07,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 20:54:07,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111970226] [2021-11-07 20:54:07,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 20:54:07,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 20:54:07,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 20:54:07,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 20:54:07,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 20:54:07,856 INFO L87 Difference]: Start difference. First operand 198 states and 259 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) [2021-11-07 20:54:08,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:54:08,128 INFO L93 Difference]: Finished difference Result 445 states and 582 transitions. [2021-11-07 20:54:08,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 20:54:08,129 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 [2021-11-07 20:54:08,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:54:08,130 INFO L225 Difference]: With dead ends: 445 [2021-11-07 20:54:08,130 INFO L226 Difference]: Without dead ends: 337 [2021-11-07 20:54:08,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.86ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 20:54:08,132 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 173 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 185.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.77ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 237.58ms IncrementalHoareTripleChecker+Time [2021-11-07 20:54:08,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 642 Invalid, 161 Unknown, 0 Unchecked, 4.77ms Time], IncrementalHoareTripleChecker [3 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 237.58ms Time] [2021-11-07 20:54:08,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-11-07 20:54:08,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 200. [2021-11-07 20:54:08,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 194 states have (on average 1.3453608247422681) internal successors, (261), 199 states have internal predecessors, (261), 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) [2021-11-07 20:54:08,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 261 transitions. [2021-11-07 20:54:08,140 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 261 transitions. Word has length 12 [2021-11-07 20:54:08,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:54:08,140 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 261 transitions. [2021-11-07 20:54:08,141 INFO L471 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) [2021-11-07 20:54:08,141 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 261 transitions. [2021-11-07 20:54:08,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-07 20:54:08,142 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:54:08,142 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:54:08,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 20:54:08,143 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-07 20:54:08,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:54:08,143 INFO L85 PathProgramCache]: Analyzing trace with hash 168111628, now seen corresponding path program 1 times [2021-11-07 20:54:08,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 20:54:08,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600265340] [2021-11-07 20:54:08,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:54:08,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 20:54:08,157 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-07 20:54:08,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [588624219] [2021-11-07 20:54:08,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:54:08,157 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 20:54:08,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 20:54:08,159 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 20:54:08,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-07 20:54:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:54:08,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 20:54:08,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 20:54:08,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:54:08,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-07 20:54:08,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 20:54:08,445 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600265340] [2021-11-07 20:54:08,445 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-07 20:54:08,445 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588624219] [2021-11-07 20:54:08,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588624219] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 20:54:08,448 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:54:08,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 20:54:08,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139445761] [2021-11-07 20:54:08,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 20:54:08,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 20:54:08,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 20:54:08,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 20:54:08,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 20:54:08,451 INFO L87 Difference]: Start difference. First operand 200 states and 261 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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) [2021-11-07 20:54:08,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:54:08,495 INFO L93 Difference]: Finished difference Result 417 states and 549 transitions. [2021-11-07 20:54:08,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 20:54:08,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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) Word has length 64 [2021-11-07 20:54:08,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:54:08,497 INFO L225 Difference]: With dead ends: 417 [2021-11-07 20:54:08,497 INFO L226 Difference]: Without dead ends: 221 [2021-11-07 20:54:08,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.54ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 20:54:08,502 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 9 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.69ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.21ms IncrementalHoareTripleChecker+Time [2021-11-07 20:54:08,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 463 Invalid, 72 Unknown, 0 Unchecked, 0.69ms Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 38.21ms Time] [2021-11-07 20:54:08,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-11-07 20:54:08,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2021-11-07 20:54:08,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 214 states have (on average 1.3130841121495327) internal successors, (281), 219 states have internal predecessors, (281), 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) [2021-11-07 20:54:08,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 281 transitions. [2021-11-07 20:54:08,516 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 281 transitions. Word has length 64 [2021-11-07 20:54:08,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:54:08,517 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 281 transitions. [2021-11-07 20:54:08,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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) [2021-11-07 20:54:08,517 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 281 transitions. [2021-11-07 20:54:08,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-07 20:54:08,522 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:54:08,523 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:54:08,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-07 20:54:08,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 20:54:08,743 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-07 20:54:08,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:54:08,743 INFO L85 PathProgramCache]: Analyzing trace with hash 521200010, now seen corresponding path program 1 times [2021-11-07 20:54:08,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 20:54:08,744 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114455558] [2021-11-07 20:54:08,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:54:08,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 20:54:08,754 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-07 20:54:08,755 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [413911960] [2021-11-07 20:54:08,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:54:08,755 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 20:54:08,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 20:54:08,756 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 20:54:08,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-07 20:54:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:54:08,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 20:54:08,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 20:54:08,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:54:08,986 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-07 20:54:08,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 20:54:08,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114455558] [2021-11-07 20:54:08,987 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-07 20:54:08,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413911960] [2021-11-07 20:54:08,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413911960] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 20:54:08,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:54:08,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 20:54:08,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598707746] [2021-11-07 20:54:08,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 20:54:08,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 20:54:08,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 20:54:08,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 20:54:08,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 20:54:08,989 INFO L87 Difference]: Start difference. First operand 220 states and 281 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 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) [2021-11-07 20:54:09,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:54:09,044 INFO L93 Difference]: Finished difference Result 428 states and 550 transitions. [2021-11-07 20:54:09,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 20:54:09,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 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) Word has length 64 [2021-11-07 20:54:09,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:54:09,045 INFO L225 Difference]: With dead ends: 428 [2021-11-07 20:54:09,045 INFO L226 Difference]: Without dead ends: 212 [2021-11-07 20:54:09,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.04ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 20:54:09,049 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 247 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.97ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.92ms IncrementalHoareTripleChecker+Time [2021-11-07 20:54:09,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 474 Invalid, 66 Unknown, 0 Unchecked, 1.97ms Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 40.92ms Time] [2021-11-07 20:54:09,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-11-07 20:54:09,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 206. [2021-11-07 20:54:09,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 200 states have (on average 1.3) internal successors, (260), 205 states have internal predecessors, (260), 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) [2021-11-07 20:54:09,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 260 transitions. [2021-11-07 20:54:09,059 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 260 transitions. Word has length 64 [2021-11-07 20:54:09,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:54:09,060 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 260 transitions. [2021-11-07 20:54:09,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 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) [2021-11-07 20:54:09,060 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 260 transitions. [2021-11-07 20:54:09,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-07 20:54:09,062 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:54:09,063 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:54:09,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-07 20:54:09,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-11-07 20:54:09,283 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-07 20:54:09,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:54:09,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1012352744, now seen corresponding path program 1 times [2021-11-07 20:54:09,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 20:54:09,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678515088] [2021-11-07 20:54:09,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:54:09,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 20:54:09,295 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-07 20:54:09,295 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [209970119] [2021-11-07 20:54:09,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:54:09,301 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 20:54:09,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 20:54:09,303 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 20:54:09,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-07 20:54:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:54:09,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-07 20:54:09,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 20:54:09,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:54:09,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-07 20:54:09,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 20:54:09,646 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678515088] [2021-11-07 20:54:09,646 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-07 20:54:09,646 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209970119] [2021-11-07 20:54:09,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209970119] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 20:54:09,646 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:54:09,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 20:54:09,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427311765] [2021-11-07 20:54:09,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 20:54:09,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 20:54:09,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 20:54:09,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 20:54:09,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 20:54:09,648 INFO L87 Difference]: Start difference. First operand 206 states and 260 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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) [2021-11-07 20:54:09,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:54:09,708 INFO L93 Difference]: Finished difference Result 542 states and 683 transitions. [2021-11-07 20:54:09,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 20:54:09,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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) Word has length 64 [2021-11-07 20:54:09,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:54:09,710 INFO L225 Difference]: With dead ends: 542 [2021-11-07 20:54:09,710 INFO L226 Difference]: Without dead ends: 340 [2021-11-07 20:54:09,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.21ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 20:54:09,711 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 132 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.30ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.95ms IncrementalHoareTripleChecker+Time [2021-11-07 20:54:09,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 544 Invalid, 32 Unknown, 0 Unchecked, 1.30ms Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 51.95ms Time] [2021-11-07 20:54:09,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-11-07 20:54:09,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 312. [2021-11-07 20:54:09,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 306 states have (on average 1.2843137254901962) internal successors, (393), 311 states have internal predecessors, (393), 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) [2021-11-07 20:54:09,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 393 transitions. [2021-11-07 20:54:09,717 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 393 transitions. Word has length 64 [2021-11-07 20:54:09,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:54:09,717 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 393 transitions. [2021-11-07 20:54:09,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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) [2021-11-07 20:54:09,718 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 393 transitions. [2021-11-07 20:54:09,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-07 20:54:09,718 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:54:09,718 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:54:09,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-07 20:54:09,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 20:54:09,924 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-07 20:54:09,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:54:09,924 INFO L85 PathProgramCache]: Analyzing trace with hash -147792665, now seen corresponding path program 1 times [2021-11-07 20:54:09,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 20:54:09,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654708210] [2021-11-07 20:54:09,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:54:09,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 20:54:09,934 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-07 20:54:09,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [269509217] [2021-11-07 20:54:09,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:54:09,934 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 20:54:09,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 20:54:09,935 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 20:54:09,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-07 20:54:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:54:10,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 20:54:10,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 20:54:10,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 20:54:10,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-07 20:54:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 20:54:10,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-07 20:54:10,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 20:54:10,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654708210] [2021-11-07 20:54:10,221 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-07 20:54:10,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269509217] [2021-11-07 20:54:10,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269509217] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 20:54:10,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:54:10,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 20:54:10,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721560051] [2021-11-07 20:54:10,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 20:54:10,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 20:54:10,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 20:54:10,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 20:54:10,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 20:54:10,224 INFO L87 Difference]: Start difference. First operand 312 states and 393 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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) [2021-11-07 20:54:10,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:54:10,418 INFO L93 Difference]: Finished difference Result 421 states and 537 transitions. [2021-11-07 20:54:10,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 20:54:10,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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 71 [2021-11-07 20:54:10,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:54:10,420 INFO L225 Difference]: With dead ends: 421 [2021-11-07 20:54:10,420 INFO L226 Difference]: Without dead ends: 396 [2021-11-07 20:54:10,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.80ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 20:54:10,421 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 135 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 142.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.99ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 176.70ms IncrementalHoareTripleChecker+Time [2021-11-07 20:54:10,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 644 Invalid, 138 Unknown, 0 Unchecked, 1.99ms Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 176.70ms Time] [2021-11-07 20:54:10,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-11-07 20:54:10,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 314. [2021-11-07 20:54:10,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 308 states have (on average 1.2824675324675325) internal successors, (395), 313 states have internal predecessors, (395), 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) [2021-11-07 20:54:10,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 395 transitions. [2021-11-07 20:54:10,428 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 395 transitions. Word has length 71 [2021-11-07 20:54:10,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:54:10,428 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 395 transitions. [2021-11-07 20:54:10,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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) [2021-11-07 20:54:10,428 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 395 transitions. [2021-11-07 20:54:10,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-07 20:54:10,429 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:54:10,429 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:54:10,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-07 20:54:10,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 20:54:10,643 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-07 20:54:10,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:54:10,644 INFO L85 PathProgramCache]: Analyzing trace with hash -2000986198, now seen corresponding path program 1 times [2021-11-07 20:54:10,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 20:54:10,644 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168824001] [2021-11-07 20:54:10,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:54:10,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 20:54:10,653 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-07 20:54:10,654 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [214554506] [2021-11-07 20:54:10,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:54:10,654 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 20:54:10,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 20:54:10,655 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 20:54:10,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-07 20:54:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:54:10,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 20:54:10,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 20:54:10,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 20:54:10,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-07 20:54:10,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 20:54:10,944 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168824001] [2021-11-07 20:54:10,944 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-07 20:54:10,944 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214554506] [2021-11-07 20:54:10,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214554506] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 20:54:10,944 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:54:10,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 20:54:10,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827382431] [2021-11-07 20:54:10,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 20:54:10,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 20:54:10,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 20:54:10,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 20:54:10,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 20:54:10,946 INFO L87 Difference]: Start difference. First operand 314 states and 395 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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) [2021-11-07 20:54:11,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:54:11,006 INFO L93 Difference]: Finished difference Result 525 states and 681 transitions. [2021-11-07 20:54:11,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 20:54:11,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 103 [2021-11-07 20:54:11,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:54:11,008 INFO L225 Difference]: With dead ends: 525 [2021-11-07 20:54:11,008 INFO L226 Difference]: Without dead ends: 356 [2021-11-07 20:54:11,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.82ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 20:54:11,008 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 9 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.06ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.52ms IncrementalHoareTripleChecker+Time [2021-11-07 20:54:11,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 449 Invalid, 72 Unknown, 0 Unchecked, 3.06ms Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 49.52ms Time] [2021-11-07 20:54:11,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-11-07 20:54:11,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 354. [2021-11-07 20:54:11,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 348 states have (on average 1.25) internal successors, (435), 353 states have internal predecessors, (435), 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) [2021-11-07 20:54:11,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 435 transitions. [2021-11-07 20:54:11,015 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 435 transitions. Word has length 103 [2021-11-07 20:54:11,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:54:11,015 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 435 transitions. [2021-11-07 20:54:11,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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) [2021-11-07 20:54:11,015 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 435 transitions. [2021-11-07 20:54:11,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-07 20:54:11,016 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:54:11,016 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:54:11,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-11-07 20:54:11,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 20:54:11,230 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-07 20:54:11,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:54:11,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1973776046, now seen corresponding path program 1 times [2021-11-07 20:54:11,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 20:54:11,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843611177] [2021-11-07 20:54:11,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:54:11,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 20:54:11,239 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-07 20:54:11,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [595871491] [2021-11-07 20:54:11,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:54:11,240 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 20:54:11,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 20:54:11,245 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 20:54:11,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-07 20:54:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:54:11,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 20:54:11,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 20:54:11,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 20:54:11,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-07 20:54:11,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 20:54:11,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843611177] [2021-11-07 20:54:11,491 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-07 20:54:11,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595871491] [2021-11-07 20:54:11,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595871491] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 20:54:11,491 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:54:11,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 20:54:11,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800780319] [2021-11-07 20:54:11,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 20:54:11,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 20:54:11,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 20:54:11,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 20:54:11,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 20:54:11,492 INFO L87 Difference]: Start difference. First operand 354 states and 435 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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) [2021-11-07 20:54:11,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:54:11,538 INFO L93 Difference]: Finished difference Result 540 states and 676 transitions. [2021-11-07 20:54:11,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 20:54:11,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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 103 [2021-11-07 20:54:11,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:54:11,546 INFO L225 Difference]: With dead ends: 540 [2021-11-07 20:54:11,546 INFO L226 Difference]: Without dead ends: 331 [2021-11-07 20:54:11,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.40ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 20:54:11,547 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 130 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.24ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.15ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.17ms IncrementalHoareTripleChecker+Time [2021-11-07 20:54:11,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 564 Invalid, 66 Unknown, 0 Unchecked, 1.15ms Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 35.17ms Time] [2021-11-07 20:54:11,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-11-07 20:54:11,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 326. [2021-11-07 20:54:11,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 320 states have (on average 1.228125) internal successors, (393), 325 states have internal predecessors, (393), 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) [2021-11-07 20:54:11,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 393 transitions. [2021-11-07 20:54:11,563 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 393 transitions. Word has length 103 [2021-11-07 20:54:11,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:54:11,563 INFO L470 AbstractCegarLoop]: Abstraction has 326 states and 393 transitions. [2021-11-07 20:54:11,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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) [2021-11-07 20:54:11,563 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 393 transitions. [2021-11-07 20:54:11,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-07 20:54:11,564 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:54:11,564 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:54:11,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-07 20:54:11,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 20:54:11,780 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-07 20:54:11,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:54:11,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1090927200, now seen corresponding path program 1 times [2021-11-07 20:54:11,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 20:54:11,781 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886120524] [2021-11-07 20:54:11,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:54:11,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 20:54:11,790 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-07 20:54:11,790 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2078841127] [2021-11-07 20:54:11,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:54:11,790 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 20:54:11,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 20:54:11,791 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 20:54:11,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-07 20:54:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:54:11,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-07 20:54:11,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 20:54:12,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:54:12,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-07 20:54:12,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 20:54:12,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886120524] [2021-11-07 20:54:12,081 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-07 20:54:12,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078841127] [2021-11-07 20:54:12,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078841127] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 20:54:12,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:54:12,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 20:54:12,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053016993] [2021-11-07 20:54:12,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 20:54:12,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 20:54:12,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 20:54:12,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 20:54:12,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 20:54:12,082 INFO L87 Difference]: Start difference. First operand 326 states and 393 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 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) [2021-11-07 20:54:12,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:54:12,249 INFO L93 Difference]: Finished difference Result 740 states and 900 transitions. [2021-11-07 20:54:12,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 20:54:12,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 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) Word has length 103 [2021-11-07 20:54:12,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:54:12,251 INFO L225 Difference]: With dead ends: 740 [2021-11-07 20:54:12,251 INFO L226 Difference]: Without dead ends: 462 [2021-11-07 20:54:12,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.35ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 20:54:12,252 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 497 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 118.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.96ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 145.22ms IncrementalHoareTripleChecker+Time [2021-11-07 20:54:12,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [497 Valid, 498 Invalid, 82 Unknown, 0 Unchecked, 1.96ms Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 145.22ms Time] [2021-11-07 20:54:12,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2021-11-07 20:54:12,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 410. [2021-11-07 20:54:12,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 404 states have (on average 1.2301980198019802) internal successors, (497), 409 states have internal predecessors, (497), 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) [2021-11-07 20:54:12,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 497 transitions. [2021-11-07 20:54:12,262 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 497 transitions. Word has length 103 [2021-11-07 20:54:12,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:54:12,263 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 497 transitions. [2021-11-07 20:54:12,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 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) [2021-11-07 20:54:12,263 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 497 transitions. [2021-11-07 20:54:12,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-07 20:54:12,264 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:54:12,264 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:54:12,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-11-07 20:54:12,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 20:54:12,480 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-07 20:54:12,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:54:12,480 INFO L85 PathProgramCache]: Analyzing trace with hash 541561274, now seen corresponding path program 1 times [2021-11-07 20:54:12,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 20:54:12,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761827773] [2021-11-07 20:54:12,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:54:12,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 20:54:12,489 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-07 20:54:12,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [375080877] [2021-11-07 20:54:12,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:54:12,490 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 20:54:12,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 20:54:12,491 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 20:54:12,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-07 20:54:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:54:12,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 51 conjunts are in the unsatisfiable core [2021-11-07 20:54:12,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 20:54:12,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 20:54:12,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-07 20:54:12,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:12,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:12,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:12,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2021-11-07 20:54:13,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 57 [2021-11-07 20:54:13,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2021-11-07 20:54:13,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 54 [2021-11-07 20:54:13,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:13,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2021-11-07 20:54:13,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-07 20:54:13,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-11-07 20:54:13,567 INFO L354 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2021-11-07 20:54:13,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2021-11-07 20:54:14,855 INFO L354 Elim1Store]: treesize reduction 364, result has 11.9 percent of original size [2021-11-07 20:54:14,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 2832 treesize of output 2281 [2021-11-07 20:54:14,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:14,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:14,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:14,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 20:54:19,163 INFO L354 Elim1Store]: treesize reduction 7776, result has 3.0 percent of original size [2021-11-07 20:54:19,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 3301 treesize of output 1804 [2021-11-07 20:54:19,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 20:54:19,222 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761827773] [2021-11-07 20:54:19,223 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-07 20:54:19,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375080877] [2021-11-07 20:54:19,223 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Some non-self update cases but no top-level DER relation [2021-11-07 20:54:19,223 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:54:19,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-07 20:54:19,223 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-11-07 20:54:19,225 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-07 20:54:19,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-11-07 20:54:19,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-11-07 20:54:19,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2021-11-07 20:54:19,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2021-11-07 20:54:19,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2021-11-07 20:54:19,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-11-07 20:54:19,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-07 20:54:19,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-07 20:54:19,450 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:54:19,453 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 20:54:19,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:54:19 BoogieIcfgContainer [2021-11-07 20:54:19,484 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 20:54:19,484 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 20:54:19,484 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 20:54:19,484 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 20:54:19,485 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:54:07" (3/4) ... [2021-11-07 20:54:19,487 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-07 20:54:19,487 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 20:54:19,488 INFO L158 Benchmark]: Toolchain (without parser) took 13672.27ms. Allocated memory was 88.1MB in the beginning and 188.7MB in the end (delta: 100.7MB). Free memory was 52.2MB in the beginning and 83.1MB in the end (delta: -30.9MB). Peak memory consumption was 68.7MB. Max. memory is 16.1GB. [2021-11-07 20:54:19,488 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 88.1MB. Free memory was 60.4MB in the beginning and 60.3MB in the end (delta: 28.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-07 20:54:19,488 INFO L158 Benchmark]: CACSL2BoogieTranslator took 567.15ms. Allocated memory was 88.1MB in the beginning and 117.4MB in the end (delta: 29.4MB). Free memory was 52.0MB in the beginning and 70.1MB in the end (delta: -18.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-07 20:54:19,490 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.17ms. Allocated memory is still 117.4MB. Free memory was 70.1MB in the beginning and 63.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-07 20:54:19,491 INFO L158 Benchmark]: Boogie Preprocessor took 60.19ms. Allocated memory is still 117.4MB. Free memory was 63.8MB in the beginning and 56.6MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-07 20:54:19,491 INFO L158 Benchmark]: RCFGBuilder took 853.24ms. Allocated memory is still 117.4MB. Free memory was 56.6MB in the beginning and 84.6MB in the end (delta: -28.0MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2021-11-07 20:54:19,491 INFO L158 Benchmark]: TraceAbstraction took 12077.67ms. Allocated memory was 117.4MB in the beginning and 188.7MB in the end (delta: 71.3MB). Free memory was 84.6MB in the beginning and 84.0MB in the end (delta: 644.2kB). Peak memory consumption was 110.9MB. Max. memory is 16.1GB. [2021-11-07 20:54:19,492 INFO L158 Benchmark]: Witness Printer took 2.96ms. Allocated memory is still 188.7MB. Free memory was 84.0MB in the beginning and 83.1MB in the end (delta: 880.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-07 20:54:19,494 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.10ms. Allocated memory is still 88.1MB. Free memory was 60.4MB in the beginning and 60.3MB in the end (delta: 28.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 567.15ms. Allocated memory was 88.1MB in the beginning and 117.4MB in the end (delta: 29.4MB). Free memory was 52.0MB in the beginning and 70.1MB in the end (delta: -18.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.17ms. Allocated memory is still 117.4MB. Free memory was 70.1MB in the beginning and 63.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.19ms. Allocated memory is still 117.4MB. Free memory was 63.8MB in the beginning and 56.6MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 853.24ms. Allocated memory is still 117.4MB. Free memory was 56.6MB in the beginning and 84.6MB in the end (delta: -28.0MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12077.67ms. Allocated memory was 117.4MB in the beginning and 188.7MB in the end (delta: 71.3MB). Free memory was 84.6MB in the beginning and 84.0MB in the end (delta: 644.2kB). Peak memory consumption was 110.9MB. Max. memory is 16.1GB. * Witness Printer took 2.96ms. Allocated memory is still 188.7MB. Free memory was 84.0MB in the beginning and 83.1MB in the end (delta: 880.6kB). 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.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 750]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint, overapproximation of bitwiseXor at line 745, overapproximation of bitwiseAnd at line 745. Possible FailurePath: [L706] int count_int_int = 0; [L733] int i; [L734] example_user_t *user, *tmp, *users=((void *)0); [L735] i=0 [L735] EXPR \read(i) [L735] COND TRUE i<10 [L736] user = (example_user_t*)malloc(sizeof(example_user_t)) [L737] COND FALSE !(user == ((void *)0)) [L740] EXPR \read(i) [L740] user->id = i [L741] EXPR \read(i) [L741] EXPR \read(i) [L741] user->cookie = i*i [L742] unsigned _ha_hashv; [L742] unsigned _hj_i,_hj_j,_hj_k; [L742] unsigned const char *_hj_key=(unsigned const char*)(&((user)->id)); [L742] _ha_hashv = 0xfeedbeefu [L742] EXPR _hj_j = 0x9e3779b9u [L742] _hj_i = _hj_j = 0x9e3779b9u [L742] _hj_k = (unsigned)(sizeof(int)) [L742] COND FALSE !(_hj_k >= 12U) [L742] _ha_hashv += (unsigned)(sizeof(int)) [L742] case 11: [L742] case 10: [L742] case 9: [L742] case 8: [L742] case 7: [L742] case 6: [L742] case 5: [L742] case 4: [L742] EXPR _hj_key[3] [L742] _hj_i += ( (unsigned)_hj_key[3] << 24 ) [L742] case 3: [L742] EXPR _hj_key[2] [L742] _hj_i += ( (unsigned)_hj_key[2] << 16 ) [L742] case 2: [L742] EXPR _hj_key[1] [L742] _hj_i += ( (unsigned)_hj_key[1] << 8 ) [L742] case 1: [L742] EXPR _hj_key[0] [L742] _hj_i += _hj_key[0] [L742] _hj_i -= _hj_j [L742] _hj_i -= _ha_hashv [L742] _hj_i ^= ( _ha_hashv >> 13 ) [L742] _hj_j -= _ha_hashv [L742] _hj_j -= _hj_i [L742] _hj_j ^= ( _hj_i << 8 ) [L742] _ha_hashv -= _hj_i [L742] _ha_hashv -= _hj_j [L742] _ha_hashv ^= ( _hj_j >> 13 ) [L742] _hj_i -= _hj_j [L742] _hj_i -= _ha_hashv [L742] _hj_i ^= ( _ha_hashv >> 12 ) [L742] _hj_j -= _ha_hashv [L742] _hj_j -= _hj_i [L742] _hj_j ^= ( _hj_i << 16 ) [L742] _ha_hashv -= _hj_i [L742] _ha_hashv -= _hj_j [L742] _ha_hashv ^= ( _hj_j >> 5 ) [L742] _hj_i -= _hj_j [L742] _hj_i -= _ha_hashv [L742] _hj_i ^= ( _ha_hashv >> 3 ) [L742] _hj_j -= _ha_hashv [L742] _hj_j -= _hj_i [L742] _hj_j ^= ( _hj_i << 10 ) [L742] _ha_hashv -= _hj_i [L742] _ha_hashv -= _hj_j [L742] _ha_hashv ^= ( _hj_j >> 15 ) [L742] (user)->hh.hashv = (_ha_hashv) [L742] (user)->hh.key = (char*) (&((user)->id)) [L742] (user)->hh.keylen = (unsigned) (sizeof(int)) [L742] COND TRUE !(users) [L742] (user)->hh.next = ((void *)0) [L742] (user)->hh.prev = ((void *)0) [L742] (user)->hh.tbl = (UT_hash_table*)malloc(sizeof(UT_hash_table)) [L742] EXPR (user)->hh.tbl [L742] COND FALSE !(!(user)->hh.tbl) [L742] (user)->hh.tbl [L742] EXPR (user)->hh.tbl [L742] (user)->hh.tbl->tail = &((user)->hh) [L742] EXPR (user)->hh.tbl [L742] (user)->hh.tbl->num_buckets = 32U [L742] EXPR (user)->hh.tbl [L742] (user)->hh.tbl->log2_num_buckets = 5U [L742] EXPR (user)->hh.tbl [L742] (user)->hh.tbl->hho = (char*)(&(user)->hh) - (char*)(user) [L742] EXPR (user)->hh.tbl [L742] (user)->hh.tbl->buckets = (UT_hash_bucket*)malloc(32U * sizeof(struct UT_hash_bucket)) [L742] EXPR (user)->hh.tbl [L742] (user)->hh.tbl->signature = 0xa0111fe1u [L742] EXPR (user)->hh.tbl [L742] EXPR (user)->hh.tbl->buckets [L742] COND FALSE !(!(user)->hh.tbl->buckets) [L742] EXPR (user)->hh.tbl [L742] (user)->hh.tbl->buckets [L742] (users) = (user) [L742] unsigned _ha_bkt; [L742] EXPR (users)->hh.tbl [L742] EXPR (users)->hh.tbl->num_items [L742] (users)->hh.tbl->num_items++ [L742] EXPR (users)->hh.tbl [L742] EXPR (users)->hh.tbl->num_buckets [L742] _ha_bkt = ((_ha_hashv) & (((users)->hh.tbl->num_buckets) - 1U)) [L742] EXPR (users)->hh.tbl [L742] EXPR (users)->hh.tbl->buckets [L742] UT_hash_bucket *_ha_head = &((users)->hh.tbl->buckets[_ha_bkt]); [L742] EXPR _ha_head->count [L742] _ha_head->count++ [L742] EXPR _ha_head->hh_head [L742] (&(user)->hh)->hh_next = _ha_head->hh_head [L742] (&(user)->hh)->hh_prev = ((void *)0) [L742] EXPR _ha_head->hh_head [L742] COND FALSE !(_ha_head->hh_head != ((void *)0)) [L742] _ha_head->hh_head = (&(user)->hh) [L742] EXPR _ha_head->count [L742] EXPR _ha_head->expand_mult [L742] (_ha_head->count >= ((_ha_head->expand_mult + 1U) * 10U)) && !(&(user)->hh)->tbl->noexpand [L742] EXPR (&(user)->hh)->tbl [L742] EXPR (&(user)->hh)->tbl->noexpand [L742] (_ha_head->count >= ((_ha_head->expand_mult + 1U) * 10U)) && !(&(user)->hh)->tbl->noexpand [L742] COND FALSE !((_ha_head->count >= ((_ha_head->expand_mult + 1U) * 10U)) && !(&(user)->hh)->tbl->noexpand) [L735] EXPR \read(i) [L735] i++ [L735] EXPR \read(i) [L735] COND FALSE !(i<10) [L744] i=0 [L744] EXPR \read(i) [L744] COND TRUE i<10 [L745] unsigned _hf_hashv; [L745] unsigned _hj_i,_hj_j,_hj_k; [L745] unsigned const char *_hj_key=(unsigned const char*)(&i); [L745] _hf_hashv = 0xfeedbeefu [L745] EXPR _hj_j = 0x9e3779b9u [L745] _hj_i = _hj_j = 0x9e3779b9u [L745] _hj_k = (unsigned)(sizeof(int)) [L745] COND FALSE !(_hj_k >= 12U) [L745] _hf_hashv += (unsigned)(sizeof(int)) [L745] case 11: [L745] case 10: [L745] case 9: [L745] case 8: [L745] case 7: [L745] case 6: [L745] case 5: [L745] case 4: [L745] EXPR _hj_key[3] [L745] _hj_i += ( (unsigned)_hj_key[3] << 24 ) [L745] case 3: [L745] EXPR _hj_key[2] [L745] _hj_i += ( (unsigned)_hj_key[2] << 16 ) [L745] case 2: [L745] EXPR _hj_key[1] [L745] _hj_i += ( (unsigned)_hj_key[1] << 8 ) [L745] case 1: [L745] EXPR _hj_key[0] [L745] _hj_i += _hj_key[0] [L745] _hj_i -= _hj_j [L745] _hj_i -= _hf_hashv [L745] _hj_i ^= ( _hf_hashv >> 13 ) [L745] _hj_j -= _hf_hashv [L745] _hj_j -= _hj_i [L745] _hj_j ^= ( _hj_i << 8 ) [L745] _hf_hashv -= _hj_i [L745] _hf_hashv -= _hj_j [L745] _hf_hashv ^= ( _hj_j >> 13 ) [L745] _hj_i -= _hj_j [L745] _hj_i -= _hf_hashv [L745] _hj_i ^= ( _hf_hashv >> 12 ) [L745] _hj_j -= _hf_hashv [L745] _hj_j -= _hj_i [L745] _hj_j ^= ( _hj_i << 16 ) [L745] _hf_hashv -= _hj_i [L745] _hf_hashv -= _hj_j [L745] _hf_hashv ^= ( _hj_j >> 5 ) [L745] _hj_i -= _hj_j [L745] _hj_i -= _hf_hashv [L745] _hj_i ^= ( _hf_hashv >> 3 ) [L745] _hj_j -= _hf_hashv [L745] _hj_j -= _hj_i [L745] _hj_j ^= ( _hj_i << 10 ) [L745] _hf_hashv -= _hj_i [L745] _hf_hashv -= _hj_j [L745] _hf_hashv ^= ( _hj_j >> 15 ) [L745] (tmp) = ((void *)0) [L745] COND TRUE \read(*users) [L745] unsigned _hf_bkt; [L745] EXPR (users)->hh.tbl [L745] EXPR (users)->hh.tbl->num_buckets [L745] _hf_bkt = ((_hf_hashv) & (((users)->hh.tbl->num_buckets) - 1U)) [L745] EXPR (users)->hh.tbl [L745] EXPR (users)->hh.tbl->buckets [L745] EXPR ((users)->hh.tbl->buckets[ _hf_bkt ]).hh_head [L745] COND FALSE !(((users)->hh.tbl->buckets[ _hf_bkt ]).hh_head != ((void *)0)) [L745] (tmp) = ((void *)0) [L745] COND FALSE !((tmp) != ((void *)0)) [L746] COND FALSE !(tmp != ((void *)0)) [L750] reach_error() - UnprovableResult [Line: 703]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 202 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 12003.08ms, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 23.49ms, AutomataDifference: 1046.06ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 13.47ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1332 SdHoareTripleChecker+Valid, 775.27ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1332 mSDsluCounter, 4541 SdHoareTripleChecker+Invalid, 609.93ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2278 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 569 IncrementalHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 2263 mSDtfsCounter, 569 mSolverCounterSat, 21.42ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 577 GetRequests, 559 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 53.06ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=410occurred in iteration=9, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 106.86ms AutomataMinimizationTime, 9 MinimizatonAttempts, 313 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 330.39ms SsaConstructionTime, 356.29ms SatisfiabilityAnalysisTime, 7782.39ms InterpolantComputationTime, 703 NumberOfCodeBlocks, 703 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 584 ConstructedInterpolants, 0 QuantifiedInterpolants, 1117 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2355 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 14/14 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 [2021-11-07 20:54:19,546 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/uthash-2.0.2/uthash_BER_test3-1.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 eb2eb63835edf753d5a467feb7a4cdd6d105155177d7d0cab8bf29c1b74dbaf6 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5b36d44 [2021-11-07 20:54:21,255 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 20:54:21,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 20:54:21,275 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 20:54:21,275 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 20:54:21,276 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 20:54:21,277 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 20:54:21,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 20:54:21,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 20:54:21,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 20:54:21,280 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 20:54:21,281 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 20:54:21,281 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 20:54:21,282 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 20:54:21,283 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 20:54:21,283 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 20:54:21,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 20:54:21,284 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 20:54:21,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 20:54:21,286 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 20:54:21,287 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 20:54:21,288 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 20:54:21,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 20:54:21,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 20:54:21,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 20:54:21,292 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 20:54:21,292 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 20:54:21,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 20:54:21,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 20:54:21,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 20:54:21,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 20:54:21,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 20:54:21,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 20:54:21,300 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 20:54:21,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 20:54:21,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 20:54:21,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 20:54:21,302 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 20:54:21,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 20:54:21,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 20:54:21,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 20:54:21,304 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-11-07 20:54:21,324 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 20:54:21,325 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 20:54:21,325 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 20:54:21,325 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 20:54:21,326 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 20:54:21,326 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 20:54:21,326 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 20:54:21,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 20:54:21,327 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 20:54:21,327 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 20:54:21,327 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 20:54:21,327 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 20:54:21,327 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 20:54:21,327 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 20:54:21,327 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-07 20:54:21,328 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-07 20:54:21,328 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 20:54:21,328 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 20:54:21,328 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 20:54:21,328 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 20:54:21,328 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 20:54:21,328 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 20:54:21,328 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 20:54:21,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 20:54:21,329 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 20:54:21,329 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 20:54:21,329 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 20:54:21,329 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-07 20:54:21,329 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-07 20:54:21,329 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-07 20:54:21,330 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-07 20:54:21,330 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 20:54:21,330 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 20:54:21,330 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 20:54:21,330 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eb2eb63835edf753d5a467feb7a4cdd6d105155177d7d0cab8bf29c1b74dbaf6 [2021-11-07 20:54:21,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 20:54:21,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 20:54:21,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 20:54:21,611 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 20:54:21,611 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 20:54:21,612 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i [2021-11-07 20:54:21,659 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60e32f9a3/dc8e0ed356f24397be8a272f03204984/FLAGca7d76afe [2021-11-07 20:54:22,155 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 20:54:22,155 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i [2021-11-07 20:54:22,177 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60e32f9a3/dc8e0ed356f24397be8a272f03204984/FLAGca7d76afe [2021-11-07 20:54:22,473 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60e32f9a3/dc8e0ed356f24397be8a272f03204984 [2021-11-07 20:54:22,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 20:54:22,477 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 20:54:22,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 20:54:22,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 20:54:22,481 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 20:54:22,481 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:54:22" (1/1) ... [2021-11-07 20:54:22,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@242edc42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:54:22, skipping insertion in model container [2021-11-07 20:54:22,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:54:22" (1/1) ... [2021-11-07 20:54:22,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 20:54:22,518 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 20:54:22,767 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i[33021,33034] [2021-11-07 20:54:22,872 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i[44590,44603] [2021-11-07 20:54:22,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 20:54:22,889 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 20:54:22,906 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i[33021,33034] [2021-11-07 20:54:22,987 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i[44590,44603] [2021-11-07 20:54:23,002 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 20:54:23,028 INFO L208 MainTranslator]: Completed translation [2021-11-07 20:54:23,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:54:23 WrapperNode [2021-11-07 20:54:23,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 20:54:23,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 20:54:23,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 20:54:23,030 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 20:54:23,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:54:23" (1/1) ... [2021-11-07 20:54:23,056 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:54:23" (1/1) ... [2021-11-07 20:54:23,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 20:54:23,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 20:54:23,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 20:54:23,092 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 20:54:23,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:54:23" (1/1) ... [2021-11-07 20:54:23,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:54:23" (1/1) ... [2021-11-07 20:54:23,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:54:23" (1/1) ... [2021-11-07 20:54:23,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:54:23" (1/1) ... [2021-11-07 20:54:23,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:54:23" (1/1) ... [2021-11-07 20:54:23,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:54:23" (1/1) ... [2021-11-07 20:54:23,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:54:23" (1/1) ... [2021-11-07 20:54:23,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 20:54:23,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 20:54:23,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 20:54:23,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 20:54:23,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:54:23" (1/1) ... [2021-11-07 20:54:23,194 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 20:54:23,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 20:54:23,211 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 20:54:23,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 20:54:23,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-07 20:54:23,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-07 20:54:23,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 20:54:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 20:54:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 20:54:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-07 20:54:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 20:54:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 20:54:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-07 20:54:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-07 20:54:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 20:54:23,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 20:54:26,837 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 20:54:26,837 INFO L299 CfgBuilder]: Removed 85 assume(true) statements. [2021-11-07 20:54:26,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:54:26 BoogieIcfgContainer [2021-11-07 20:54:26,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 20:54:26,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 20:54:26,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 20:54:26,844 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 20:54:26,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:54:22" (1/3) ... [2021-11-07 20:54:26,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158840ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:54:26, skipping insertion in model container [2021-11-07 20:54:26,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:54:23" (2/3) ... [2021-11-07 20:54:26,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158840ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:54:26, skipping insertion in model container [2021-11-07 20:54:26,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:54:26" (3/3) ... [2021-11-07 20:54:26,848 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_BER_test3-1.i [2021-11-07 20:54:26,852 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 20:54:26,852 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-11-07 20:54:26,902 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 20:54:26,908 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 20:54:26,909 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-07 20:54:26,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 202 states, 195 states have (on average 1.7230769230769232) internal successors, (336), 201 states have internal predecessors, (336), 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) [2021-11-07 20:54:26,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 20:54:26,930 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:54:26,930 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:54:26,931 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-07 20:54:26,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:54:26,935 INFO L85 PathProgramCache]: Analyzing trace with hash 239232295, now seen corresponding path program 1 times [2021-11-07 20:54:26,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 20:54:26,943 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563208305] [2021-11-07 20:54:26,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:54:26,944 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 20:54:26,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 20:54:26,946 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 20:54:26,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-07 20:54:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:54:27,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-07 20:54:27,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 20:54:27,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:54:27,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 20:54:27,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:54:27,168 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 20:54:27,169 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563208305] [2021-11-07 20:54:27,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563208305] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 20:54:27,169 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:54:27,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-07 20:54:27,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927712952] [2021-11-07 20:54:27,171 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 20:54:27,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-07 20:54:27,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 20:54:27,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-07 20:54:27,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 20:54:27,193 INFO L87 Difference]: Start difference. First operand has 202 states, 195 states have (on average 1.7230769230769232) internal successors, (336), 201 states have internal predecessors, (336), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2021-11-07 20:54:27,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:54:27,220 INFO L93 Difference]: Finished difference Result 402 states and 670 transitions. [2021-11-07 20:54:27,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-07 20:54:27,222 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2021-11-07 20:54:27,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:54:27,229 INFO L225 Difference]: With dead ends: 402 [2021-11-07 20:54:27,230 INFO L226 Difference]: Without dead ends: 198 [2021-11-07 20:54:27,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.12ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 20:54:27,240 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.94ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-07 20:54:27,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 1.94ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-07 20:54:27,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-07 20:54:27,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-11-07 20:54:27,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 192 states have (on average 1.3489583333333333) internal successors, (259), 197 states have internal predecessors, (259), 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) [2021-11-07 20:54:27,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 259 transitions. [2021-11-07 20:54:27,295 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 259 transitions. Word has length 9 [2021-11-07 20:54:27,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:54:27,295 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 259 transitions. [2021-11-07 20:54:27,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2021-11-07 20:54:27,296 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 259 transitions. [2021-11-07 20:54:27,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 20:54:27,296 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:54:27,296 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:54:27,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-07 20:54:27,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 20:54:27,511 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-07 20:54:27,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:54:27,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1042319138, now seen corresponding path program 1 times [2021-11-07 20:54:27,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 20:54:27,513 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486175500] [2021-11-07 20:54:27,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:54:27,513 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 20:54:27,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 20:54:27,515 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 20:54:27,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-07 20:54:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:54:27,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 20:54:27,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 20:54:27,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 20:54:27,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-07 20:54:27,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:54:27,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 20:54:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:54:27,847 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 20:54:27,849 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486175500] [2021-11-07 20:54:27,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486175500] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 20:54:27,850 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:54:27,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-07 20:54:27,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586954571] [2021-11-07 20:54:27,850 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 20:54:27,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 20:54:27,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 20:54:27,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 20:54:27,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 20:54:27,856 INFO L87 Difference]: Start difference. First operand 198 states and 259 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2021-11-07 20:54:30,469 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 20:54:31,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:54:31,383 INFO L93 Difference]: Finished difference Result 552 states and 722 transitions. [2021-11-07 20:54:31,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 20:54:31,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 [2021-11-07 20:54:31,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:54:31,386 INFO L225 Difference]: With dead ends: 552 [2021-11-07 20:54:31,386 INFO L226 Difference]: Without dead ends: 444 [2021-11-07 20:54:31,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 47.06ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 20:54:31,388 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 477 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3251.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.89ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3466.80ms IncrementalHoareTripleChecker+Time [2021-11-07 20:54:31,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [477 Valid, 756 Invalid, 210 Unknown, 0 Unchecked, 8.89ms Time], IncrementalHoareTripleChecker [8 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 3466.80ms Time] [2021-11-07 20:54:31,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-11-07 20:54:31,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 200. [2021-11-07 20:54:31,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 194 states have (on average 1.3453608247422681) internal successors, (261), 199 states have internal predecessors, (261), 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) [2021-11-07 20:54:31,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 261 transitions. [2021-11-07 20:54:31,401 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 261 transitions. Word has length 12 [2021-11-07 20:54:31,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:54:31,401 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 261 transitions. [2021-11-07 20:54:31,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2021-11-07 20:54:31,401 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 261 transitions. [2021-11-07 20:54:31,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-07 20:54:31,403 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:54:31,403 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:54:31,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-07 20:54:31,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 20:54:31,608 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-07 20:54:31,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:54:31,608 INFO L85 PathProgramCache]: Analyzing trace with hash 168111628, now seen corresponding path program 1 times [2021-11-07 20:54:31,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 20:54:31,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116594304] [2021-11-07 20:54:31,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:54:31,609 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 20:54:31,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 20:54:31,612 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 20:54:31,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-07 20:54:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:54:31,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 20:54:31,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 20:54:31,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:54:31,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 20:54:32,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:54:32,080 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 20:54:32,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116594304] [2021-11-07 20:54:32,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1116594304] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 20:54:32,080 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:54:32,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-11-07 20:54:32,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348149003] [2021-11-07 20:54:32,080 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 20:54:32,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 20:54:32,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 20:54:32,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 20:54:32,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 20:54:32,082 INFO L87 Difference]: Start difference. First operand 200 states and 261 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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) [2021-11-07 20:54:32,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:54:32,205 INFO L93 Difference]: Finished difference Result 405 states and 530 transitions. [2021-11-07 20:54:32,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 20:54:32,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 64 [2021-11-07 20:54:32,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:54:32,207 INFO L225 Difference]: With dead ends: 405 [2021-11-07 20:54:32,207 INFO L226 Difference]: Without dead ends: 209 [2021-11-07 20:54:32,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.07ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-07 20:54:32,213 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 244 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.42ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 92.16ms IncrementalHoareTripleChecker+Time [2021-11-07 20:54:32,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 477 Invalid, 69 Unknown, 0 Unchecked, 3.42ms Time], IncrementalHoareTripleChecker [30 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 92.16ms Time] [2021-11-07 20:54:32,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-11-07 20:54:32,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 203. [2021-11-07 20:54:32,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 197 states have (on average 1.299492385786802) internal successors, (256), 202 states have internal predecessors, (256), 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) [2021-11-07 20:54:32,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 256 transitions. [2021-11-07 20:54:32,236 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 256 transitions. Word has length 64 [2021-11-07 20:54:32,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:54:32,236 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 256 transitions. [2021-11-07 20:54:32,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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) [2021-11-07 20:54:32,236 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 256 transitions. [2021-11-07 20:54:32,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-07 20:54:32,239 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:54:32,240 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:54:32,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-07 20:54:32,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 20:54:32,448 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-07 20:54:32,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:54:32,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1012352744, now seen corresponding path program 1 times [2021-11-07 20:54:32,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 20:54:32,449 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523044621] [2021-11-07 20:54:32,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:54:32,450 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 20:54:32,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 20:54:32,450 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 20:54:32,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-07 20:54:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:54:32,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 20:54:32,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 20:54:32,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:54:32,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 20:54:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:54:33,244 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 20:54:33,244 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [523044621] [2021-11-07 20:54:33,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [523044621] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 20:54:33,244 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:54:33,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-07 20:54:33,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018618114] [2021-11-07 20:54:33,244 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 20:54:33,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 20:54:33,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 20:54:33,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 20:54:33,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 20:54:33,245 INFO L87 Difference]: Start difference. First operand 203 states and 256 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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) [2021-11-07 20:54:34,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:54:34,235 INFO L93 Difference]: Finished difference Result 533 states and 671 transitions. [2021-11-07 20:54:34,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 20:54:34,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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) Word has length 64 [2021-11-07 20:54:34,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:54:34,236 INFO L225 Difference]: With dead ends: 533 [2021-11-07 20:54:34,236 INFO L226 Difference]: Without dead ends: 334 [2021-11-07 20:54:34,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.93ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 20:54:34,237 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 128 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 928.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.66ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 975.55ms IncrementalHoareTripleChecker+Time [2021-11-07 20:54:34,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 532 Invalid, 36 Unknown, 0 Unchecked, 1.66ms Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 975.55ms Time] [2021-11-07 20:54:34,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-11-07 20:54:34,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 306. [2021-11-07 20:54:34,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 300 states have (on average 1.2833333333333334) internal successors, (385), 305 states have internal predecessors, (385), 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) [2021-11-07 20:54:34,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 385 transitions. [2021-11-07 20:54:34,244 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 385 transitions. Word has length 64 [2021-11-07 20:54:34,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:54:34,244 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 385 transitions. [2021-11-07 20:54:34,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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) [2021-11-07 20:54:34,245 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 385 transitions. [2021-11-07 20:54:34,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-07 20:54:34,246 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:54:34,246 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:54:34,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-11-07 20:54:34,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 20:54:34,457 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-07 20:54:34,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:54:34,458 INFO L85 PathProgramCache]: Analyzing trace with hash -147792665, now seen corresponding path program 1 times [2021-11-07 20:54:34,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 20:54:34,458 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144279071] [2021-11-07 20:54:34,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:54:34,459 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 20:54:34,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 20:54:34,459 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 20:54:34,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-07 20:54:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:54:34,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 20:54:34,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 20:54:34,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:54:34,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 20:54:34,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:54:34,871 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 20:54:34,871 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [144279071] [2021-11-07 20:54:34,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [144279071] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 20:54:34,871 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:54:34,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-07 20:54:34,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649315219] [2021-11-07 20:54:34,871 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 20:54:34,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 20:54:34,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 20:54:34,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 20:54:34,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 20:54:34,872 INFO L87 Difference]: Start difference. First operand 306 states and 385 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 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) [2021-11-07 20:54:34,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:54:34,938 INFO L93 Difference]: Finished difference Result 570 states and 727 transitions. [2021-11-07 20:54:34,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 20:54:34,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 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) Word has length 71 [2021-11-07 20:54:34,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:54:34,940 INFO L225 Difference]: With dead ends: 570 [2021-11-07 20:54:34,940 INFO L226 Difference]: Without dead ends: 309 [2021-11-07 20:54:34,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.44ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 20:54:34,941 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.00ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 58.20ms IncrementalHoareTripleChecker+Time [2021-11-07 20:54:34,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 724 Invalid, 20 Unknown, 0 Unchecked, 1.00ms Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 58.20ms Time] [2021-11-07 20:54:34,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-11-07 20:54:34,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2021-11-07 20:54:34,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 303 states have (on average 1.2805280528052805) internal successors, (388), 308 states have internal predecessors, (388), 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) [2021-11-07 20:54:34,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 388 transitions. [2021-11-07 20:54:34,948 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 388 transitions. Word has length 71 [2021-11-07 20:54:34,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:54:34,948 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 388 transitions. [2021-11-07 20:54:34,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 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) [2021-11-07 20:54:34,948 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 388 transitions. [2021-11-07 20:54:34,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-07 20:54:34,949 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:54:34,950 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:54:34,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-07 20:54:35,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 20:54:35,162 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-07 20:54:35,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:54:35,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1065048653, now seen corresponding path program 1 times [2021-11-07 20:54:35,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 20:54:35,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410387341] [2021-11-07 20:54:35,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:54:35,163 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 20:54:35,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 20:54:35,163 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 20:54:35,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-07 20:54:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:54:35,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-07 20:54:35,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 20:54:35,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 20:54:35,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 20:54:35,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 20:54:35,682 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 20:54:35,682 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410387341] [2021-11-07 20:54:35,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410387341] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 20:54:35,682 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 20:54:35,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-11-07 20:54:35,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979710267] [2021-11-07 20:54:35,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-07 20:54:35,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 20:54:35,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 20:54:35,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 20:54:35,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-07 20:54:35,683 INFO L87 Difference]: Start difference. First operand 309 states and 388 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 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) [2021-11-07 20:54:35,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:54:35,950 INFO L93 Difference]: Finished difference Result 579 states and 739 transitions. [2021-11-07 20:54:35,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 20:54:35,951 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 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 74 [2021-11-07 20:54:35,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:54:35,952 INFO L225 Difference]: With dead ends: 579 [2021-11-07 20:54:35,952 INFO L226 Difference]: Without dead ends: 315 [2021-11-07 20:54:35,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 158.01ms TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-11-07 20:54:35,953 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 0 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 145.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.49ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 166.50ms IncrementalHoareTripleChecker+Time [2021-11-07 20:54:35,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 963 Invalid, 50 Unknown, 0 Unchecked, 1.49ms Time], IncrementalHoareTripleChecker [13 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 166.50ms Time] [2021-11-07 20:54:35,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-11-07 20:54:35,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2021-11-07 20:54:35,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 309 states have (on average 1.2750809061488673) internal successors, (394), 314 states have internal predecessors, (394), 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) [2021-11-07 20:54:35,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 394 transitions. [2021-11-07 20:54:35,960 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 394 transitions. Word has length 74 [2021-11-07 20:54:35,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:54:35,960 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 394 transitions. [2021-11-07 20:54:35,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 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) [2021-11-07 20:54:35,960 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 394 transitions. [2021-11-07 20:54:35,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-07 20:54:35,961 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:54:35,961 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:54:35,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-07 20:54:36,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 20:54:36,172 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-07 20:54:36,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:54:36,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1820271245, now seen corresponding path program 2 times [2021-11-07 20:54:36,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 20:54:36,173 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595458919] [2021-11-07 20:54:36,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-07 20:54:36,173 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 20:54:36,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 20:54:36,174 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 20:54:36,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-07 20:54:36,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-07 20:54:36,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 20:54:36,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 20:54:36,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 20:54:36,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 20:54:36,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-07 20:54:36,407 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-07 20:54:36,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 20:54:36,507 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-07 20:54:36,507 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 20:54:36,507 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595458919] [2021-11-07 20:54:36,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595458919] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 20:54:36,507 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:54:36,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-07 20:54:36,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423110155] [2021-11-07 20:54:36,508 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 20:54:36,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 20:54:36,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 20:54:36,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 20:54:36,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 20:54:36,508 INFO L87 Difference]: Start difference. First operand 315 states and 394 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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) [2021-11-07 20:54:38,625 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 20:54:40,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:54:40,230 INFO L93 Difference]: Finished difference Result 490 states and 625 transitions. [2021-11-07 20:54:40,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 20:54:40,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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 [2021-11-07 20:54:40,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:54:40,233 INFO L225 Difference]: With dead ends: 490 [2021-11-07 20:54:40,233 INFO L226 Difference]: Without dead ends: 465 [2021-11-07 20:54:40,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 35.64ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-07 20:54:40,234 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 207 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3446.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.99ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3670.32ms IncrementalHoareTripleChecker+Time [2021-11-07 20:54:40,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 830 Invalid, 238 Unknown, 0 Unchecked, 4.99ms Time], IncrementalHoareTripleChecker [6 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 3670.32ms Time] [2021-11-07 20:54:40,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2021-11-07 20:54:40,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 386. [2021-11-07 20:54:40,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 380 states have (on average 1.2894736842105263) internal successors, (490), 385 states have internal predecessors, (490), 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) [2021-11-07 20:54:40,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 490 transitions. [2021-11-07 20:54:40,247 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 490 transitions. Word has length 80 [2021-11-07 20:54:40,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:54:40,247 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 490 transitions. [2021-11-07 20:54:40,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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) [2021-11-07 20:54:40,248 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 490 transitions. [2021-11-07 20:54:40,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-07 20:54:40,248 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:54:40,248 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:54:40,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-07 20:54:40,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 20:54:40,456 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-07 20:54:40,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:54:40,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1224331210, now seen corresponding path program 1 times [2021-11-07 20:54:40,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 20:54:40,457 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039823286] [2021-11-07 20:54:40,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:54:40,457 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 20:54:40,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 20:54:40,458 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 20:54:40,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-07 20:54:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:54:40,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-07 20:54:40,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 20:54:40,941 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-07 20:54:40,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 20:54:41,500 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-07 20:54:41,500 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 20:54:41,500 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039823286] [2021-11-07 20:54:41,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039823286] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 20:54:41,500 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 20:54:41,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-11-07 20:54:41,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649063845] [2021-11-07 20:54:41,501 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-07 20:54:41,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 20:54:41,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 20:54:41,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 20:54:41,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-11-07 20:54:41,502 INFO L87 Difference]: Start difference. First operand 386 states and 490 transitions. Second operand has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 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) [2021-11-07 20:54:42,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:54:42,946 INFO L93 Difference]: Finished difference Result 739 states and 955 transitions. [2021-11-07 20:54:42,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 20:54:42,947 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 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 112 [2021-11-07 20:54:42,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:54:42,948 INFO L225 Difference]: With dead ends: 739 [2021-11-07 20:54:42,948 INFO L226 Difference]: Without dead ends: 398 [2021-11-07 20:54:42,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 878.21ms TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2021-11-07 20:54:42,949 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 0 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 842.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.02ms SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 910.65ms IncrementalHoareTripleChecker+Time [2021-11-07 20:54:42,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1919 Invalid, 162 Unknown, 0 Unchecked, 3.02ms Time], IncrementalHoareTripleChecker [45 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 910.65ms Time] [2021-11-07 20:54:42,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-11-07 20:54:42,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2021-11-07 20:54:42,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 392 states have (on average 1.280612244897959) internal successors, (502), 397 states have internal predecessors, (502), 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) [2021-11-07 20:54:42,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 502 transitions. [2021-11-07 20:54:42,958 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 502 transitions. Word has length 112 [2021-11-07 20:54:42,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:54:42,959 INFO L470 AbstractCegarLoop]: Abstraction has 398 states and 502 transitions. [2021-11-07 20:54:42,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 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) [2021-11-07 20:54:42,959 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 502 transitions. [2021-11-07 20:54:42,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-07 20:54:42,960 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:54:42,960 INFO L514 BasicCegarLoop]: trace histogram [14, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:54:42,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-07 20:54:43,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 20:54:43,172 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-07 20:54:43,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:54:43,172 INFO L85 PathProgramCache]: Analyzing trace with hash -2016870474, now seen corresponding path program 2 times [2021-11-07 20:54:43,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 20:54:43,173 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118025522] [2021-11-07 20:54:43,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-07 20:54:43,173 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 20:54:43,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 20:54:43,174 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 20:54:43,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-07 20:54:43,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-07 20:54:43,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 20:54:43,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 20:54:43,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 20:54:43,459 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-11-07 20:54:43,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 20:54:43,622 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-11-07 20:54:43,622 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 20:54:43,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118025522] [2021-11-07 20:54:43,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118025522] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 20:54:43,622 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:54:43,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-11-07 20:54:43,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705075589] [2021-11-07 20:54:43,623 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 20:54:43,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 20:54:43,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 20:54:43,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 20:54:43,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 20:54:43,623 INFO L87 Difference]: Start difference. First operand 398 states and 502 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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) [2021-11-07 20:54:43,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:54:43,717 INFO L93 Difference]: Finished difference Result 645 states and 838 transitions. [2021-11-07 20:54:43,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 20:54:43,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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 124 [2021-11-07 20:54:43,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:54:43,719 INFO L225 Difference]: With dead ends: 645 [2021-11-07 20:54:43,719 INFO L226 Difference]: Without dead ends: 410 [2021-11-07 20:54:43,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.14ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-07 20:54:43,721 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 249 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.17ms SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 74.69ms IncrementalHoareTripleChecker+Time [2021-11-07 20:54:43,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 547 Invalid, 74 Unknown, 0 Unchecked, 1.17ms Time], IncrementalHoareTripleChecker [37 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 74.69ms Time] [2021-11-07 20:54:43,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-11-07 20:54:43,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 407. [2021-11-07 20:54:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 401 states have (on average 1.2144638403990025) internal successors, (487), 406 states have internal predecessors, (487), 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) [2021-11-07 20:54:43,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 487 transitions. [2021-11-07 20:54:43,739 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 487 transitions. Word has length 124 [2021-11-07 20:54:43,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:54:43,739 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 487 transitions. [2021-11-07 20:54:43,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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) [2021-11-07 20:54:43,739 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 487 transitions. [2021-11-07 20:54:43,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-07 20:54:43,740 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:54:43,740 INFO L514 BasicCegarLoop]: trace histogram [14, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:54:43,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-07 20:54:43,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 20:54:43,951 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-07 20:54:43,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:54:43,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1333208362, now seen corresponding path program 1 times [2021-11-07 20:54:43,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 20:54:43,952 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729273008] [2021-11-07 20:54:43,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:54:43,952 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 20:54:43,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 20:54:43,953 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 20:54:43,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-07 20:54:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:54:44,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-07 20:54:44,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 20:54:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 2 proven. 105 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-07 20:54:44,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 20:54:45,919 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 2 proven. 105 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-07 20:54:45,920 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 20:54:45,920 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729273008] [2021-11-07 20:54:45,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729273008] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 20:54:45,920 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 20:54:45,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2021-11-07 20:54:45,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415002467] [2021-11-07 20:54:45,920 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-07 20:54:45,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-07 20:54:45,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 20:54:45,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-07 20:54:45,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2021-11-07 20:54:45,922 INFO L87 Difference]: Start difference. First operand 407 states and 487 transitions. Second operand has 32 states, 32 states have (on average 4.1875) internal successors, (134), 32 states have internal predecessors, (134), 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) [2021-11-07 20:54:55,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:54:55,872 INFO L93 Difference]: Finished difference Result 793 states and 973 transitions. [2021-11-07 20:54:55,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-07 20:54:55,873 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.1875) internal successors, (134), 32 states have internal predecessors, (134), 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 124 [2021-11-07 20:54:55,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:54:55,874 INFO L225 Difference]: With dead ends: 793 [2021-11-07 20:54:55,874 INFO L226 Difference]: Without dead ends: 431 [2021-11-07 20:54:55,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 4652.24ms TimeCoverageRelationStatistics Valid=734, Invalid=1336, Unknown=0, NotChecked=0, Total=2070 [2021-11-07 20:54:55,876 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 3648 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6185.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3883 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.01ms SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6439.96ms IncrementalHoareTripleChecker+Time [2021-11-07 20:54:55,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 3883 Invalid, 533 Unknown, 0 Unchecked, 7.01ms Time], IncrementalHoareTripleChecker [157 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 6439.96ms Time] [2021-11-07 20:54:55,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-11-07 20:54:55,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2021-11-07 20:54:55,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 425 states have (on average 1.2023529411764706) internal successors, (511), 430 states have internal predecessors, (511), 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) [2021-11-07 20:54:55,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 511 transitions. [2021-11-07 20:54:55,887 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 511 transitions. Word has length 124 [2021-11-07 20:54:55,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:54:55,887 INFO L470 AbstractCegarLoop]: Abstraction has 431 states and 511 transitions. [2021-11-07 20:54:55,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.1875) internal successors, (134), 32 states have internal predecessors, (134), 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) [2021-11-07 20:54:55,887 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 511 transitions. [2021-11-07 20:54:55,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-07 20:54:55,888 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:54:55,888 INFO L514 BasicCegarLoop]: trace histogram [30, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:54:55,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-07 20:54:56,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 20:54:56,101 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-07 20:54:56,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:54:56,101 INFO L85 PathProgramCache]: Analyzing trace with hash -2039593942, now seen corresponding path program 2 times [2021-11-07 20:54:56,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 20:54:56,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946801770] [2021-11-07 20:54:56,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-07 20:54:56,102 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 20:54:56,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 20:54:56,103 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 20:54:56,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-07 20:54:56,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-07 20:54:56,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 20:54:56,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-07 20:54:56,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 20:54:56,463 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2021-11-07 20:54:56,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 20:54:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2021-11-07 20:54:56,676 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 20:54:56,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946801770] [2021-11-07 20:54:56,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946801770] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 20:54:56,677 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:54:56,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 5] imperfect sequences [] total 5 [2021-11-07 20:54:56,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128689647] [2021-11-07 20:54:56,677 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 20:54:56,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 20:54:56,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 20:54:56,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 20:54:56,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-07 20:54:56,678 INFO L87 Difference]: Start difference. First operand 431 states and 511 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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) [2021-11-07 20:54:56,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:54:56,764 INFO L93 Difference]: Finished difference Result 653 states and 785 transitions. [2021-11-07 20:54:56,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 20:54:56,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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 148 [2021-11-07 20:54:56,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:54:56,765 INFO L225 Difference]: With dead ends: 653 [2021-11-07 20:54:56,766 INFO L226 Difference]: Without dead ends: 434 [2021-11-07 20:54:56,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.99ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-07 20:54:56,766 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 3 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.75ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 70.19ms IncrementalHoareTripleChecker+Time [2021-11-07 20:54:56,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 647 Invalid, 64 Unknown, 0 Unchecked, 4.75ms Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 70.19ms Time] [2021-11-07 20:54:56,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-11-07 20:54:56,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2021-11-07 20:54:56,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 425 states have (on average 1.1811764705882353) internal successors, (502), 430 states have internal predecessors, (502), 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) [2021-11-07 20:54:56,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 502 transitions. [2021-11-07 20:54:56,777 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 502 transitions. Word has length 148 [2021-11-07 20:54:56,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:54:56,777 INFO L470 AbstractCegarLoop]: Abstraction has 431 states and 502 transitions. [2021-11-07 20:54:56,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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) [2021-11-07 20:54:56,777 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 502 transitions. [2021-11-07 20:54:56,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-07 20:54:56,778 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:54:56,778 INFO L514 BasicCegarLoop]: trace histogram [30, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:54:56,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-07 20:54:56,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 20:54:56,990 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-07 20:54:56,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:54:56,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1997207916, now seen corresponding path program 1 times [2021-11-07 20:54:56,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 20:54:56,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110305820] [2021-11-07 20:54:56,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:54:56,991 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 20:54:56,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 20:54:56,992 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 20:54:56,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-07 20:54:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:54:57,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-07 20:54:57,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 20:54:58,331 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 2 proven. 465 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-11-07 20:54:58,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 20:55:01,622 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 2 proven. 465 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-11-07 20:55:01,622 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 20:55:01,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110305820] [2021-11-07 20:55:01,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110305820] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 20:55:01,622 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 20:55:01,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2021-11-07 20:55:01,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347954500] [2021-11-07 20:55:01,623 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-07 20:55:01,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2021-11-07 20:55:01,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 20:55:01,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-11-07 20:55:01,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=933, Invalid=3099, Unknown=0, NotChecked=0, Total=4032 [2021-11-07 20:55:01,625 INFO L87 Difference]: Start difference. First operand 431 states and 502 transitions. Second operand has 64 states, 64 states have (on average 2.59375) internal successors, (166), 64 states have internal predecessors, (166), 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) [2021-11-07 20:56:12,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:56:12,573 INFO L93 Difference]: Finished difference Result 847 states and 1015 transitions. [2021-11-07 20:56:12,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-11-07 20:56:12,574 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.59375) internal successors, (166), 64 states have internal predecessors, (166), 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 148 [2021-11-07 20:56:12,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:56:12,575 INFO L225 Difference]: With dead ends: 847 [2021-11-07 20:56:12,575 INFO L226 Difference]: Without dead ends: 461 [2021-11-07 20:56:12,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 29433.84ms TimeCoverageRelationStatistics Valid=2700, Invalid=6042, Unknown=0, NotChecked=0, Total=8742 [2021-11-07 20:56:12,578 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 7980 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44241.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8215 SdHoareTripleChecker+Invalid, 1698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.83ms SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45042.47ms IncrementalHoareTripleChecker+Time [2021-11-07 20:56:12,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 8215 Invalid, 1698 Unknown, 0 Unchecked, 14.83ms Time], IncrementalHoareTripleChecker [555 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 45042.47ms Time] [2021-11-07 20:56:12,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-11-07 20:56:12,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2021-11-07 20:56:12,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 455 states have (on average 1.1692307692307693) internal successors, (532), 460 states have internal predecessors, (532), 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) [2021-11-07 20:56:12,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 532 transitions. [2021-11-07 20:56:12,592 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 532 transitions. Word has length 148 [2021-11-07 20:56:12,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:56:12,592 INFO L470 AbstractCegarLoop]: Abstraction has 461 states and 532 transitions. [2021-11-07 20:56:12,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.59375) internal successors, (166), 64 states have internal predecessors, (166), 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) [2021-11-07 20:56:12,593 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 532 transitions. [2021-11-07 20:56:12,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-11-07 20:56:12,593 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:56:12,594 INFO L514 BasicCegarLoop]: trace histogram [44, 31, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:56:12,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-11-07 20:56:12,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 20:56:12,808 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-07 20:56:12,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:56:12,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1100843980, now seen corresponding path program 2 times [2021-11-07 20:56:12,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 20:56:12,809 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891643299] [2021-11-07 20:56:12,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-07 20:56:12,809 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 20:56:12,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 20:56:12,810 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 20:56:12,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-07 20:56:13,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-07 20:56:13,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 20:56:13,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-07 20:56:13,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 20:56:14,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 2 proven. 496 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-07 20:56:14,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 20:56:18,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 2 proven. 496 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-07 20:56:18,852 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 20:56:18,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1891643299] [2021-11-07 20:56:18,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1891643299] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 20:56:18,852 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 20:56:18,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2021-11-07 20:56:18,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062844741] [2021-11-07 20:56:18,852 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-07 20:56:18,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2021-11-07 20:56:18,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 20:56:18,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-11-07 20:56:18,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1153, Invalid=3137, Unknown=0, NotChecked=0, Total=4290 [2021-11-07 20:56:18,854 INFO L87 Difference]: Start difference. First operand 461 states and 532 transitions. Second operand has 66 states, 66 states have (on average 2.5454545454545454) internal successors, (168), 66 states have internal predecessors, (168), 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) [2021-11-07 20:57:41,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:57:41,436 INFO L93 Difference]: Finished difference Result 910 states and 1081 transitions. [2021-11-07 20:57:41,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-11-07 20:57:41,440 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.5454545454545454) internal successors, (168), 66 states have internal predecessors, (168), 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 178 [2021-11-07 20:57:41,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:57:41,441 INFO L225 Difference]: With dead ends: 910 [2021-11-07 20:57:41,441 INFO L226 Difference]: Without dead ends: 494 [2021-11-07 20:57:41,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 35742.41ms TimeCoverageRelationStatistics Valid=3199, Invalid=6113, Unknown=0, NotChecked=0, Total=9312 [2021-11-07 20:57:41,444 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 7296 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50122.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7531 SdHoareTripleChecker+Invalid, 1930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.75ms SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51150.94ms IncrementalHoareTripleChecker+Time [2021-11-07 20:57:41,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 7531 Invalid, 1930 Unknown, 0 Unchecked, 14.75ms Time], IncrementalHoareTripleChecker [591 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 51150.94ms Time] [2021-11-07 20:57:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2021-11-07 20:57:41,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2021-11-07 20:57:41,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 488 states have (on average 1.1577868852459017) internal successors, (565), 493 states have internal predecessors, (565), 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) [2021-11-07 20:57:41,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 565 transitions. [2021-11-07 20:57:41,467 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 565 transitions. Word has length 178 [2021-11-07 20:57:41,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:57:41,467 INFO L470 AbstractCegarLoop]: Abstraction has 494 states and 565 transitions. [2021-11-07 20:57:41,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.5454545454545454) internal successors, (168), 66 states have internal predecessors, (168), 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) [2021-11-07 20:57:41,467 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 565 transitions. [2021-11-07 20:57:41,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2021-11-07 20:57:41,468 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:57:41,469 INFO L514 BasicCegarLoop]: trace histogram [64, 44, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:57:41,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-07 20:57:41,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 20:57:41,688 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-07 20:57:41,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:57:41,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1145284768, now seen corresponding path program 3 times [2021-11-07 20:57:41,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 20:57:41,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245208152] [2021-11-07 20:57:41,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 20:57:41,689 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 20:57:41,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 20:57:41,690 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 20:57:41,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-07 20:57:41,908 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-07 20:57:41,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 20:57:41,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 20:57:41,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 20:57:42,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3070 trivial. 0 not checked. [2021-11-07 20:57:42,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 20:57:43,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3070 trivial. 0 not checked. [2021-11-07 20:57:43,024 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 20:57:43,024 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245208152] [2021-11-07 20:57:43,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245208152] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 20:57:43,024 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:57:43,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-07 20:57:43,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560477012] [2021-11-07 20:57:43,025 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 20:57:43,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 20:57:43,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 20:57:43,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 20:57:43,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 20:57:43,026 INFO L87 Difference]: Start difference. First operand 494 states and 565 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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) [2021-11-07 20:57:45,172 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 20:57:45,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:57:45,954 INFO L93 Difference]: Finished difference Result 1070 states and 1232 transitions. [2021-11-07 20:57:45,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 20:57:45,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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 211 [2021-11-07 20:57:45,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:57:45,957 INFO L225 Difference]: With dead ends: 1070 [2021-11-07 20:57:45,957 INFO L226 Difference]: Without dead ends: 621 [2021-11-07 20:57:45,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.21ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 20:57:45,958 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 476 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2751.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.76ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2878.80ms IncrementalHoareTripleChecker+Time [2021-11-07 20:57:45,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [476 Valid, 441 Invalid, 86 Unknown, 0 Unchecked, 1.76ms Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 1 Unknown, 0 Unchecked, 2878.80ms Time] [2021-11-07 20:57:45,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2021-11-07 20:57:45,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 569. [2021-11-07 20:57:45,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 563 states have (on average 1.1580817051509769) internal successors, (652), 568 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) [2021-11-07 20:57:45,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 652 transitions. [2021-11-07 20:57:45,977 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 652 transitions. Word has length 211 [2021-11-07 20:57:45,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:57:45,977 INFO L470 AbstractCegarLoop]: Abstraction has 569 states and 652 transitions. [2021-11-07 20:57:45,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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) [2021-11-07 20:57:45,978 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 652 transitions. [2021-11-07 20:57:45,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2021-11-07 20:57:45,978 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:57:45,978 INFO L514 BasicCegarLoop]: trace histogram [64, 44, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:57:45,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-11-07 20:57:46,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 20:57:46,190 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-07 20:57:46,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:57:46,190 INFO L85 PathProgramCache]: Analyzing trace with hash 670931834, now seen corresponding path program 1 times [2021-11-07 20:57:46,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 20:57:46,191 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369038396] [2021-11-07 20:57:46,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:57:46,191 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 20:57:46,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 20:57:46,192 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 20:57:46,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-07 20:57:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:57:47,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 67 conjunts are in the unsatisfiable core [2021-11-07 20:57:47,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 20:57:50,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 2 proven. 2080 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-07 20:57:50,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 20:58:04,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 2 proven. 2080 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-07 20:58:04,752 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 20:58:04,752 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369038396] [2021-11-07 20:58:04,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369038396] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 20:58:04,752 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 20:58:04,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 132 [2021-11-07 20:58:04,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339499459] [2021-11-07 20:58:04,752 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-07 20:58:04,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2021-11-07 20:58:04,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 20:58:04,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2021-11-07 20:58:04,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4486, Invalid=12806, Unknown=0, NotChecked=0, Total=17292 [2021-11-07 20:58:04,757 INFO L87 Difference]: Start difference. First operand 569 states and 652 transitions. Second operand has 132 states, 132 states have (on average 1.8257575757575757) internal successors, (241), 132 states have internal predecessors, (241), 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) [2021-11-07 21:02:11,625 WARN L227 SmtUtils]: Spent 6.40s on a formula simplification that was a NOOP. DAG size: 196 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-07 21:02:20,580 WARN L227 SmtUtils]: Spent 6.26s on a formula simplification that was a NOOP. DAG size: 193 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-07 21:02:29,683 WARN L227 SmtUtils]: Spent 6.40s on a formula simplification that was a NOOP. DAG size: 190 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-07 21:02:38,153 WARN L227 SmtUtils]: Spent 5.70s on a formula simplification that was a NOOP. DAG size: 187 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-07 21:02:46,845 WARN L227 SmtUtils]: Spent 5.91s on a formula simplification that was a NOOP. DAG size: 184 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-07 21:03:19,005 WARN L227 SmtUtils]: Spent 6.64s on a formula simplification that was a NOOP. DAG size: 172 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-07 21:03:27,276 WARN L227 SmtUtils]: Spent 5.45s on a formula simplification that was a NOOP. DAG size: 169 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-07 21:04:40,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 21:04:40,159 INFO L93 Difference]: Finished difference Result 1045 states and 1271 transitions. [2021-11-07 21:04:40,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2021-11-07 21:04:40,160 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 132 states have (on average 1.8257575757575757) internal successors, (241), 132 states have internal predecessors, (241), 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 218 [2021-11-07 21:04:40,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 21:04:40,162 INFO L225 Difference]: With dead ends: 1045 [2021-11-07 21:04:40,162 INFO L226 Difference]: Without dead ends: 635 [2021-11-07 21:04:40,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1995 ImplicationChecksByTransitivity, 276615.11ms TimeCoverageRelationStatistics Valid=12934, Invalid=25286, Unknown=0, NotChecked=0, Total=38220 [2021-11-07 21:04:40,169 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 15276 mSDsCounter, 0 mSdLazyCounter, 4781 mSolverCounterSat, 1119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 131323.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15511 SdHoareTripleChecker+Invalid, 5900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 40.15ms SdHoareTripleChecker+Time, 1119 IncrementalHoareTripleChecker+Valid, 4781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 134665.20ms IncrementalHoareTripleChecker+Time [2021-11-07 21:04:40,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 15511 Invalid, 5900 Unknown, 0 Unchecked, 40.15ms Time], IncrementalHoareTripleChecker [1119 Valid, 4781 Invalid, 0 Unknown, 0 Unchecked, 134665.20ms Time] [2021-11-07 21:04:40,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2021-11-07 21:04:40,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2021-11-07 21:04:40,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 629 states have (on average 1.1414944356120826) internal successors, (718), 634 states have internal predecessors, (718), 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) [2021-11-07 21:04:40,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 718 transitions. [2021-11-07 21:04:40,248 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 718 transitions. Word has length 218 [2021-11-07 21:04:40,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 21:04:40,249 INFO L470 AbstractCegarLoop]: Abstraction has 635 states and 718 transitions. [2021-11-07 21:04:40,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 1.8257575757575757) internal successors, (241), 132 states have internal predecessors, (241), 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) [2021-11-07 21:04:40,249 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 718 transitions. [2021-11-07 21:04:40,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2021-11-07 21:04:40,250 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 21:04:40,250 INFO L514 BasicCegarLoop]: trace histogram [130, 44, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 21:04:40,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-11-07 21:04:40,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 21:04:40,463 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-07 21:04:40,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 21:04:40,464 INFO L85 PathProgramCache]: Analyzing trace with hash 249759226, now seen corresponding path program 2 times [2021-11-07 21:04:40,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 21:04:40,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480371170] [2021-11-07 21:04:40,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-07 21:04:40,465 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 21:04:40,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 21:04:40,467 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 21:04:40,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-07 21:04:42,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-07 21:04:42,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 21:04:42,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 133 conjunts are in the unsatisfiable core [2021-11-07 21:04:42,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 21:04:52,682 INFO L134 CoverageAnalysis]: Checked inductivity of 9507 backedges. 2 proven. 8515 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-07 21:04:52,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 21:05:50,286 INFO L134 CoverageAnalysis]: Checked inductivity of 9507 backedges. 2 proven. 8515 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-07 21:05:50,287 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 21:05:50,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480371170] [2021-11-07 21:05:50,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480371170] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 21:05:50,287 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 21:05:50,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133] total 264 [2021-11-07 21:05:50,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729752362] [2021-11-07 21:05:50,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-07 21:05:50,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 264 states [2021-11-07 21:05:50,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 21:05:50,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 264 interpolants. [2021-11-07 21:05:50,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17686, Invalid=51746, Unknown=0, NotChecked=0, Total=69432 [2021-11-07 21:05:50,296 INFO L87 Difference]: Start difference. First operand 635 states and 718 transitions. Second operand has 264 states, 264 states have (on average 1.4128787878787878) internal successors, (373), 264 states have internal predecessors, (373), 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) Killed by 15