./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version c7c6ca5d
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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_JEN_nondet_test2-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 --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 e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92
--- Real Ultimate output ---
This is Ultimate 0.2.5-?-c7c6ca5-m
[2024-11-09 06:12:58,410 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-09 06:12:58,511 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-09 06:12:58,517 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-09 06:12:58,519 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-09 06:12:58,552 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-09 06:12:58,553 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-09 06:12:58,553 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-09 06:12:58,554 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-09 06:12:58,556 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-09 06:12:58,556 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-09 06:12:58,556 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-09 06:12:58,557 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-09 06:12:58,557 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-09 06:12:58,559 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-09 06:12:58,560 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-09 06:12:58,560 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-09 06:12:58,560 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-09 06:12:58,560 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-09 06:12:58,561 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-09 06:12:58,561 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-09 06:12:58,564 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-09 06:12:58,564 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-09 06:12:58,565 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-09 06:12:58,565 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-09 06:12:58,565 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-09 06:12:58,566 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-09 06:12:58,566 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-09 06:12:58,566 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-09 06:12:58,566 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-09 06:12:58,567 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-09 06:12:58,567 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-09 06:12:58,567 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-09 06:12:58,567 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-09 06:12:58,568 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-09 06:12:58,568 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-09 06:12:58,568 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-09 06:12:58,569 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-09 06:12:58,570 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-09 06:12:58,570 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-09 06:12:58,570 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-09 06:12:58,571 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-09 06:12:58,571 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92
[2024-11-09 06:12:58,840 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-09 06:12:58,868 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-09 06:12:58,872 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-09 06:12:58,873 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-09 06:12:58,874 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-09 06:12:58,876 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i
[2024-11-09 06:13:00,377 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-09 06:13:00,670 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-09 06:13:00,671 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i
[2024-11-09 06:13:00,690 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f849709a6/a0d6dcb7831149aaaf1043c1fcd3296c/FLAG31e7f1fc3
[2024-11-09 06:13:00,703 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f849709a6/a0d6dcb7831149aaaf1043c1fcd3296c
[2024-11-09 06:13:00,706 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-09 06:13:00,707 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-09 06:13:00,708 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-09 06:13:00,709 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-09 06:13:00,714 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-09 06:13:00,715 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:13:00" (1/1) ...
[2024-11-09 06:13:00,716 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4278b7cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:00, skipping insertion in model container
[2024-11-09 06:13:00,718 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:13:00" (1/1) ...
[2024-11-09 06:13:00,770 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-09 06:13:01,209 WARN  L250   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_JEN_nondet_test2-1.i[37435,37448]
[2024-11-09 06:13:01,324 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-09 06:13:01,341 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-09 06:13:01,384 WARN  L250   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_JEN_nondet_test2-1.i[37435,37448]
[2024-11-09 06:13:01,435 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-09 06:13:01,485 INFO  L204         MainTranslator]: Completed translation
[2024-11-09 06:13:01,486 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:01 WrapperNode
[2024-11-09 06:13:01,486 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-09 06:13:01,488 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-09 06:13:01,488 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-09 06:13:01,488 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-09 06:13:01,495 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:01" (1/1) ...
[2024-11-09 06:13:01,547 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:01" (1/1) ...
[2024-11-09 06:13:01,644 INFO  L138                Inliner]: procedures = 207, calls = 221, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1277
[2024-11-09 06:13:01,645 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-09 06:13:01,646 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-09 06:13:01,646 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-09 06:13:01,646 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-09 06:13:01,657 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:01" (1/1) ...
[2024-11-09 06:13:01,658 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:01" (1/1) ...
[2024-11-09 06:13:01,666 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:01" (1/1) ...
[2024-11-09 06:13:01,753 INFO  L175           MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 170, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4].
[2024-11-09 06:13:01,757 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:01" (1/1) ...
[2024-11-09 06:13:01,757 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:01" (1/1) ...
[2024-11-09 06:13:01,804 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:01" (1/1) ...
[2024-11-09 06:13:01,822 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:01" (1/1) ...
[2024-11-09 06:13:01,827 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:01" (1/1) ...
[2024-11-09 06:13:01,832 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:01" (1/1) ...
[2024-11-09 06:13:01,841 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-09 06:13:01,842 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-09 06:13:01,842 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-09 06:13:01,843 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-09 06:13:01,843 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:01" (1/1) ...
[2024-11-09 06:13:01,849 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-09 06:13:01,860 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-09 06:13:01,880 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-09 06:13:01,884 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-09 06:13:01,933 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0
[2024-11-09 06:13:01,933 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1
[2024-11-09 06:13:01,934 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2
[2024-11-09 06:13:01,935 INFO  L138     BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0
[2024-11-09 06:13:01,935 INFO  L138     BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1
[2024-11-09 06:13:01,935 INFO  L138     BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2
[2024-11-09 06:13:01,935 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-11-09 06:13:01,935 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#0
[2024-11-09 06:13:01,935 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#1
[2024-11-09 06:13:01,936 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#2
[2024-11-09 06:13:01,936 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-11-09 06:13:01,936 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#0
[2024-11-09 06:13:01,936 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#1
[2024-11-09 06:13:01,936 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#2
[2024-11-09 06:13:01,936 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2024-11-09 06:13:01,936 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2024-11-09 06:13:01,936 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#2
[2024-11-09 06:13:01,938 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-11-09 06:13:01,938 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-09 06:13:01,938 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#0
[2024-11-09 06:13:01,938 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#1
[2024-11-09 06:13:01,939 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#2
[2024-11-09 06:13:01,939 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-09 06:13:01,940 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#1
[2024-11-09 06:13:01,940 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#2
[2024-11-09 06:13:01,940 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-09 06:13:01,940 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-09 06:13:02,205 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-09 06:13:02,207 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-09 06:13:03,601 INFO  L?                        ?]: Removed 294 outVars from TransFormulas that were not future-live.
[2024-11-09 06:13:03,601 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-09 06:13:03,629 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-09 06:13:03,631 INFO  L316             CfgBuilder]: Removed 54 assume(true) statements.
[2024-11-09 06:13:03,632 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:13:03 BoogieIcfgContainer
[2024-11-09 06:13:03,632 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-09 06:13:03,634 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-09 06:13:03,634 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-09 06:13:03,639 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-09 06:13:03,640 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:13:00" (1/3) ...
[2024-11-09 06:13:03,641 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2014d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:13:03, skipping insertion in model container
[2024-11-09 06:13:03,641 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:13:01" (2/3) ...
[2024-11-09 06:13:03,641 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2014d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:13:03, skipping insertion in model container
[2024-11-09 06:13:03,641 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:13:03" (3/3) ...
[2024-11-09 06:13:03,643 INFO  L112   eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test2-1.i
[2024-11-09 06:13:03,660 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-09 06:13:03,660 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-09 06:13:03,744 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-09 06:13:03,751 INFO  L333      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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@79207d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-09 06:13:03,751 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-09 06:13:03,760 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 366 states, 360 states have (on average 1.6194444444444445) internal successors, (583), 361 states have internal predecessors, (583), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-09 06:13:03,766 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2024-11-09 06:13:03,767 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-09 06:13:03,768 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-09 06:13:03,768 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-09 06:13:03,773 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-09 06:13:03,773 INFO  L85        PathProgramCache]: Analyzing trace with hash -271903450, now seen corresponding path program 1 times
[2024-11-09 06:13:03,783 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-09 06:13:03,783 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695487349]
[2024-11-09 06:13:03,783 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 06:13:03,784 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-09 06:13:04,007 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 06:13:04,076 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-09 06:13:04,077 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-09 06:13:04,077 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695487349]
[2024-11-09 06:13:04,079 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695487349] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-09 06:13:04,079 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-09 06:13:04,079 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-09 06:13:04,083 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305247149]
[2024-11-09 06:13:04,084 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-09 06:13:04,090 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-09 06:13:04,091 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-09 06:13:04,115 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-09 06:13:04,116 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-09 06:13:04,119 INFO  L87              Difference]: Start difference. First operand  has 366 states, 360 states have (on average 1.6194444444444445) internal successors, (583), 361 states have internal predecessors, (583), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand  has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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)
[2024-11-09 06:13:04,192 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-09 06:13:04,192 INFO  L93              Difference]: Finished difference Result 729 states and 1174 transitions.
[2024-11-09 06:13:04,193 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-11-09 06:13:04,195 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11
[2024-11-09 06:13:04,195 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-09 06:13:04,206 INFO  L225             Difference]: With dead ends: 729
[2024-11-09 06:13:04,207 INFO  L226             Difference]: Without dead ends: 362
[2024-11-09 06:13:04,212 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-09 06:13:04,218 INFO  L432           NwaCegarLoop]: 530 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-09 06:13:04,219 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-09 06:13:04,240 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 362 states.
[2024-11-09 06:13:04,274 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362.
[2024-11-09 06:13:04,276 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 362 states, 357 states have (on average 1.453781512605042) internal successors, (519), 357 states have internal predecessors, (519), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-09 06:13:04,278 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 525 transitions.
[2024-11-09 06:13:04,282 INFO  L78                 Accepts]: Start accepts. Automaton has 362 states and 525 transitions. Word has length 11
[2024-11-09 06:13:04,282 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-09 06:13:04,283 INFO  L471      AbstractCegarLoop]: Abstraction has 362 states and 525 transitions.
[2024-11-09 06:13:04,283 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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)
[2024-11-09 06:13:04,283 INFO  L276                IsEmpty]: Start isEmpty. Operand 362 states and 525 transitions.
[2024-11-09 06:13:04,287 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2024-11-09 06:13:04,287 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-09 06:13:04,287 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-09 06:13:04,287 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-09 06:13:04,288 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-09 06:13:04,288 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-09 06:13:04,288 INFO  L85        PathProgramCache]: Analyzing trace with hash -1335073267, now seen corresponding path program 1 times
[2024-11-09 06:13:04,288 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-09 06:13:04,289 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269729057]
[2024-11-09 06:13:04,289 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 06:13:04,289 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-09 06:13:04,344 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 06:13:04,670 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-09 06:13:04,670 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-09 06:13:04,670 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269729057]
[2024-11-09 06:13:04,671 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269729057] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-09 06:13:04,671 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-09 06:13:04,671 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-09 06:13:04,671 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824347244]
[2024-11-09 06:13:04,671 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-09 06:13:04,673 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-09 06:13:04,674 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-09 06:13:04,675 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-09 06:13:04,675 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-09 06:13:04,676 INFO  L87              Difference]: Start difference. First operand 362 states and 525 transitions. Second operand  has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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)
[2024-11-09 06:13:04,817 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-09 06:13:04,817 INFO  L93              Difference]: Finished difference Result 479 states and 693 transitions.
[2024-11-09 06:13:04,818 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-09 06:13:04,818 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66
[2024-11-09 06:13:04,818 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-09 06:13:04,822 INFO  L225             Difference]: With dead ends: 479
[2024-11-09 06:13:04,823 INFO  L226             Difference]: Without dead ends: 320
[2024-11-09 06:13:04,825 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-09 06:13:04,826 INFO  L432           NwaCegarLoop]: 423 mSDtfsCounter, 30 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-09 06:13:04,827 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1250 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-09 06:13:04,830 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 320 states.
[2024-11-09 06:13:04,846 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320.
[2024-11-09 06:13:04,847 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 320 states, 315 states have (on average 1.403174603174603) internal successors, (442), 315 states have internal predecessors, (442), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-09 06:13:04,848 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 448 transitions.
[2024-11-09 06:13:04,849 INFO  L78                 Accepts]: Start accepts. Automaton has 320 states and 448 transitions. Word has length 66
[2024-11-09 06:13:04,849 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-09 06:13:04,849 INFO  L471      AbstractCegarLoop]: Abstraction has 320 states and 448 transitions.
[2024-11-09 06:13:04,850 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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)
[2024-11-09 06:13:04,850 INFO  L276                IsEmpty]: Start isEmpty. Operand 320 states and 448 transitions.
[2024-11-09 06:13:04,852 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2024-11-09 06:13:04,852 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-09 06:13:04,852 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-09 06:13:04,853 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-09 06:13:04,853 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-09 06:13:04,853 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-09 06:13:04,854 INFO  L85        PathProgramCache]: Analyzing trace with hash 1779429657, now seen corresponding path program 1 times
[2024-11-09 06:13:04,854 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-09 06:13:04,854 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428611416]
[2024-11-09 06:13:04,854 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 06:13:04,854 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-09 06:13:04,932 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 06:13:05,380 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-09 06:13:05,382 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-09 06:13:05,382 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428611416]
[2024-11-09 06:13:05,382 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428611416] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-09 06:13:05,382 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-09 06:13:05,383 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-09 06:13:05,384 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431600403]
[2024-11-09 06:13:05,384 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-09 06:13:05,384 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-09 06:13:05,386 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-09 06:13:05,387 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-09 06:13:05,387 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-11-09 06:13:05,387 INFO  L87              Difference]: Start difference. First operand 320 states and 448 transitions. Second operand  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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)
[2024-11-09 06:13:05,523 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-09 06:13:05,524 INFO  L93              Difference]: Finished difference Result 752 states and 1048 transitions.
[2024-11-09 06:13:05,524 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-09 06:13:05,524 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66
[2024-11-09 06:13:05,524 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-09 06:13:05,527 INFO  L225             Difference]: With dead ends: 752
[2024-11-09 06:13:05,527 INFO  L226             Difference]: Without dead ends: 632
[2024-11-09 06:13:05,529 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-11-09 06:13:05,532 INFO  L432           NwaCegarLoop]: 472 mSDtfsCounter, 428 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1839 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-09 06:13:05,532 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1839 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-09 06:13:05,533 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 632 states.
[2024-11-09 06:13:05,546 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 322.
[2024-11-09 06:13:05,551 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 322 states, 317 states have (on average 1.4006309148264984) internal successors, (444), 317 states have internal predecessors, (444), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-09 06:13:05,552 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 450 transitions.
[2024-11-09 06:13:05,555 INFO  L78                 Accepts]: Start accepts. Automaton has 322 states and 450 transitions. Word has length 66
[2024-11-09 06:13:05,556 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-09 06:13:05,556 INFO  L471      AbstractCegarLoop]: Abstraction has 322 states and 450 transitions.
[2024-11-09 06:13:05,556 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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)
[2024-11-09 06:13:05,556 INFO  L276                IsEmpty]: Start isEmpty. Operand 322 states and 450 transitions.
[2024-11-09 06:13:05,560 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2024-11-09 06:13:05,560 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-09 06:13:05,561 INFO  L215           NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-09 06:13:05,561 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-09 06:13:05,561 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-09 06:13:05,562 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-09 06:13:05,562 INFO  L85        PathProgramCache]: Analyzing trace with hash 857389398, now seen corresponding path program 1 times
[2024-11-09 06:13:05,562 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-09 06:13:05,563 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681651208]
[2024-11-09 06:13:05,563 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 06:13:05,563 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-09 06:13:05,627 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 06:13:05,874 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-09 06:13:05,875 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-09 06:13:05,875 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681651208]
[2024-11-09 06:13:05,876 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681651208] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-09 06:13:05,876 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-09 06:13:05,890 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-09 06:13:05,891 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871976608]
[2024-11-09 06:13:05,891 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-09 06:13:05,891 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-09 06:13:05,892 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-09 06:13:05,892 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-09 06:13:05,893 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-09 06:13:05,893 INFO  L87              Difference]: Start difference. First operand 322 states and 450 transitions. Second operand  has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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)
[2024-11-09 06:13:05,976 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-09 06:13:05,976 INFO  L93              Difference]: Finished difference Result 597 states and 829 transitions.
[2024-11-09 06:13:05,977 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-09 06:13:05,977 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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 142
[2024-11-09 06:13:05,977 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-09 06:13:05,979 INFO  L225             Difference]: With dead ends: 597
[2024-11-09 06:13:05,979 INFO  L226             Difference]: Without dead ends: 280
[2024-11-09 06:13:05,980 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-09 06:13:05,984 INFO  L432           NwaCegarLoop]: 340 mSDtfsCounter, 30 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-09 06:13:05,985 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1001 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-09 06:13:05,986 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 280 states.
[2024-11-09 06:13:05,997 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280.
[2024-11-09 06:13:05,997 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 280 states, 275 states have (on average 1.3345454545454545) internal successors, (367), 275 states have internal predecessors, (367), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-09 06:13:05,999 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 373 transitions.
[2024-11-09 06:13:06,000 INFO  L78                 Accepts]: Start accepts. Automaton has 280 states and 373 transitions. Word has length 142
[2024-11-09 06:13:06,000 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-09 06:13:06,001 INFO  L471      AbstractCegarLoop]: Abstraction has 280 states and 373 transitions.
[2024-11-09 06:13:06,002 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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)
[2024-11-09 06:13:06,002 INFO  L276                IsEmpty]: Start isEmpty. Operand 280 states and 373 transitions.
[2024-11-09 06:13:06,007 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2024-11-09 06:13:06,007 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-09 06:13:06,008 INFO  L215           NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-09 06:13:06,008 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-09 06:13:06,008 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-09 06:13:06,009 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-09 06:13:06,009 INFO  L85        PathProgramCache]: Analyzing trace with hash -172432950, now seen corresponding path program 1 times
[2024-11-09 06:13:06,009 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-09 06:13:06,009 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154578451]
[2024-11-09 06:13:06,010 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 06:13:06,010 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-09 06:13:06,081 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 06:13:06,196 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-09 06:13:06,197 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-09 06:13:06,197 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154578451]
[2024-11-09 06:13:06,197 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154578451] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-09 06:13:06,198 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-09 06:13:06,198 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-09 06:13:06,198 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210868324]
[2024-11-09 06:13:06,198 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-09 06:13:06,199 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-09 06:13:06,199 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-09 06:13:06,200 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-09 06:13:06,200 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-09 06:13:06,200 INFO  L87              Difference]: Start difference. First operand 280 states and 373 transitions. Second operand  has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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)
[2024-11-09 06:13:06,259 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-09 06:13:06,260 INFO  L93              Difference]: Finished difference Result 738 states and 988 transitions.
[2024-11-09 06:13:06,260 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-09 06:13:06,261 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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 142
[2024-11-09 06:13:06,261 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-09 06:13:06,263 INFO  L225             Difference]: With dead ends: 738
[2024-11-09 06:13:06,263 INFO  L226             Difference]: Without dead ends: 463
[2024-11-09 06:13:06,264 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-09 06:13:06,265 INFO  L432           NwaCegarLoop]: 469 mSDtfsCounter, 178 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-09 06:13:06,266 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 813 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-09 06:13:06,267 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 463 states.
[2024-11-09 06:13:06,276 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 461.
[2024-11-09 06:13:06,277 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 461 states, 456 states have (on average 1.3399122807017543) internal successors, (611), 456 states have internal predecessors, (611), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-09 06:13:06,279 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 617 transitions.
[2024-11-09 06:13:06,280 INFO  L78                 Accepts]: Start accepts. Automaton has 461 states and 617 transitions. Word has length 142
[2024-11-09 06:13:06,280 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-09 06:13:06,280 INFO  L471      AbstractCegarLoop]: Abstraction has 461 states and 617 transitions.
[2024-11-09 06:13:06,280 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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)
[2024-11-09 06:13:06,281 INFO  L276                IsEmpty]: Start isEmpty. Operand 461 states and 617 transitions.
[2024-11-09 06:13:06,282 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 158
[2024-11-09 06:13:06,282 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-09 06:13:06,282 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-09 06:13:06,283 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-09 06:13:06,283 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-09 06:13:06,283 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-09 06:13:06,283 INFO  L85        PathProgramCache]: Analyzing trace with hash 1935951651, now seen corresponding path program 1 times
[2024-11-09 06:13:06,284 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-09 06:13:06,284 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751822695]
[2024-11-09 06:13:06,284 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 06:13:06,284 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-09 06:13:06,356 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 06:13:06,636 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-09 06:13:06,638 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 06:13:06,641 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-11-09 06:13:06,644 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 06:13:06,648 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-09 06:13:06,649 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-09 06:13:06,649 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751822695]
[2024-11-09 06:13:06,651 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751822695] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-09 06:13:06,651 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-09 06:13:06,652 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-09 06:13:06,652 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349451015]
[2024-11-09 06:13:06,652 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-09 06:13:06,653 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-09 06:13:06,653 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-09 06:13:06,654 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-09 06:13:06,655 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-09 06:13:06,655 INFO  L87              Difference]: Start difference. First operand 461 states and 617 transitions. Second operand  has 4 states, 4 states have (on average 37.5) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-09 06:13:06,852 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-09 06:13:06,852 INFO  L93              Difference]: Finished difference Result 890 states and 1201 transitions.
[2024-11-09 06:13:06,852 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-09 06:13:06,853 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 37.5) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 157
[2024-11-09 06:13:06,853 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-09 06:13:06,858 INFO  L225             Difference]: With dead ends: 890
[2024-11-09 06:13:06,858 INFO  L226             Difference]: Without dead ends: 464
[2024-11-09 06:13:06,860 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-09 06:13:06,861 INFO  L432           NwaCegarLoop]: 352 mSDtfsCounter, 3 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-09 06:13:06,863 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 984 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-09 06:13:06,864 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 464 states.
[2024-11-09 06:13:06,878 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 461.
[2024-11-09 06:13:06,879 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 461 states, 456 states have (on average 1.3267543859649122) internal successors, (605), 456 states have internal predecessors, (605), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-09 06:13:06,881 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 611 transitions.
[2024-11-09 06:13:06,882 INFO  L78                 Accepts]: Start accepts. Automaton has 461 states and 611 transitions. Word has length 157
[2024-11-09 06:13:06,882 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-09 06:13:06,882 INFO  L471      AbstractCegarLoop]: Abstraction has 461 states and 611 transitions.
[2024-11-09 06:13:06,883 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 37.5) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-09 06:13:06,883 INFO  L276                IsEmpty]: Start isEmpty. Operand 461 states and 611 transitions.
[2024-11-09 06:13:06,886 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 158
[2024-11-09 06:13:06,886 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-09 06:13:06,886 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-09 06:13:06,886 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-09 06:13:06,887 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-09 06:13:06,887 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-09 06:13:06,887 INFO  L85        PathProgramCache]: Analyzing trace with hash -1652419039, now seen corresponding path program 1 times
[2024-11-09 06:13:06,888 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-09 06:13:06,888 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893007665]
[2024-11-09 06:13:06,888 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 06:13:06,888 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-09 06:13:06,979 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 06:13:07,190 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-09 06:13:07,192 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 06:13:07,195 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-11-09 06:13:07,197 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 06:13:07,200 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-09 06:13:07,200 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-09 06:13:07,200 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893007665]
[2024-11-09 06:13:07,200 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893007665] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-09 06:13:07,200 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-09 06:13:07,201 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-09 06:13:07,201 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998527300]
[2024-11-09 06:13:07,201 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-09 06:13:07,201 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-09 06:13:07,202 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-09 06:13:07,202 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-09 06:13:07,202 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-09 06:13:07,203 INFO  L87              Difference]: Start difference. First operand 461 states and 611 transitions. Second operand  has 6 states, 6 states have (on average 25.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-09 06:13:07,706 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-09 06:13:07,706 INFO  L93              Difference]: Finished difference Result 912 states and 1215 transitions.
[2024-11-09 06:13:07,707 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-09 06:13:07,707 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 25.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 157
[2024-11-09 06:13:07,708 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-09 06:13:07,711 INFO  L225             Difference]: With dead ends: 912
[2024-11-09 06:13:07,711 INFO  L226             Difference]: Without dead ends: 543
[2024-11-09 06:13:07,712 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2024-11-09 06:13:07,712 INFO  L432           NwaCegarLoop]: 429 mSDtfsCounter, 773 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-09 06:13:07,713 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 1387 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-09 06:13:07,714 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 543 states.
[2024-11-09 06:13:07,727 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 367.
[2024-11-09 06:13:07,728 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 367 states, 362 states have (on average 1.3176795580110496) internal successors, (477), 362 states have internal predecessors, (477), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-09 06:13:07,731 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 483 transitions.
[2024-11-09 06:13:07,732 INFO  L78                 Accepts]: Start accepts. Automaton has 367 states and 483 transitions. Word has length 157
[2024-11-09 06:13:07,732 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-09 06:13:07,733 INFO  L471      AbstractCegarLoop]: Abstraction has 367 states and 483 transitions.
[2024-11-09 06:13:07,733 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 25.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-09 06:13:07,734 INFO  L276                IsEmpty]: Start isEmpty. Operand 367 states and 483 transitions.
[2024-11-09 06:13:07,748 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 168
[2024-11-09 06:13:07,749 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-09 06:13:07,749 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-09 06:13:07,749 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-09 06:13:07,750 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-09 06:13:07,750 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-09 06:13:07,750 INFO  L85        PathProgramCache]: Analyzing trace with hash -1956116019, now seen corresponding path program 1 times
[2024-11-09 06:13:07,751 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-09 06:13:07,751 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739879222]
[2024-11-09 06:13:07,751 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 06:13:07,751 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-09 06:13:08,007 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 06:13:08,264 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-09 06:13:08,267 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 06:13:08,297 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-11-09 06:13:08,299 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 06:13:08,301 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-09 06:13:08,302 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-09 06:13:08,302 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739879222]
[2024-11-09 06:13:08,302 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739879222] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-09 06:13:08,302 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536342554]
[2024-11-09 06:13:08,302 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 06:13:08,303 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-09 06:13:08,303 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-09 06:13:08,305 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)
[2024-11-09 06:13:08,306 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-09 06:13:08,718 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 06:13:08,725 INFO  L255         TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 33 conjuncts are in the unsatisfiable core
[2024-11-09 06:13:08,736 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-09 06:13:08,769 INFO  L378             Elim1Store]: Elim1 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
[2024-11-09 06:13:08,797 INFO  L378             Elim1Store]: Elim1 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 16 treesize of output 17
[2024-11-09 06:13:09,436 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-09 06:13:09,436 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 58
[2024-11-09 06:13:09,684 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-09 06:13:09,684 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-09 06:13:09,685 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [536342554] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-09 06:13:09,685 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-09 06:13:09,685 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14
[2024-11-09 06:13:09,685 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293105173]
[2024-11-09 06:13:09,685 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-09 06:13:09,686 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-09 06:13:09,686 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-09 06:13:09,687 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-09 06:13:09,687 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182
[2024-11-09 06:13:09,687 INFO  L87              Difference]: Start difference. First operand 367 states and 483 transitions. Second operand  has 11 states, 11 states have (on average 14.545454545454545) internal successors, (160), 11 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-09 06:13:11,448 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-09 06:13:11,449 INFO  L93              Difference]: Finished difference Result 861 states and 1146 transitions.
[2024-11-09 06:13:11,449 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-11-09 06:13:11,451 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 14.545454545454545) internal successors, (160), 11 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167
[2024-11-09 06:13:11,451 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-09 06:13:11,455 INFO  L225             Difference]: With dead ends: 861
[2024-11-09 06:13:11,456 INFO  L226             Difference]: Without dead ends: 539
[2024-11-09 06:13:11,457 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462
[2024-11-09 06:13:11,458 INFO  L432           NwaCegarLoop]: 379 mSDtfsCounter, 462 mSDsluCounter, 2056 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 2435 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2024-11-09 06:13:11,458 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 2435 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2024-11-09 06:13:11,460 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 539 states.
[2024-11-09 06:13:11,475 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 367.
[2024-11-09 06:13:11,476 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 367 states, 362 states have (on average 1.3149171270718232) internal successors, (476), 362 states have internal predecessors, (476), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-09 06:13:11,478 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 482 transitions.
[2024-11-09 06:13:11,478 INFO  L78                 Accepts]: Start accepts. Automaton has 367 states and 482 transitions. Word has length 167
[2024-11-09 06:13:11,478 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-09 06:13:11,478 INFO  L471      AbstractCegarLoop]: Abstraction has 367 states and 482 transitions.
[2024-11-09 06:13:11,479 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 14.545454545454545) internal successors, (160), 11 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-09 06:13:11,479 INFO  L276                IsEmpty]: Start isEmpty. Operand 367 states and 482 transitions.
[2024-11-09 06:13:11,481 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 169
[2024-11-09 06:13:11,482 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-09 06:13:11,482 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-09 06:13:11,505 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-11-09 06:13:11,686 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-09 06:13:11,687 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-09 06:13:11,688 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-09 06:13:11,688 INFO  L85        PathProgramCache]: Analyzing trace with hash 811065810, now seen corresponding path program 1 times
[2024-11-09 06:13:11,688 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-09 06:13:11,688 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038703837]
[2024-11-09 06:13:11,689 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 06:13:11,689 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-09 06:13:11,923 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 06:13:12,172 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-09 06:13:12,176 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 06:13:12,203 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69
[2024-11-09 06:13:12,205 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 06:13:12,208 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-09 06:13:12,209 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-09 06:13:12,209 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038703837]
[2024-11-09 06:13:12,209 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038703837] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-09 06:13:12,211 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341213702]
[2024-11-09 06:13:12,211 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 06:13:12,211 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-09 06:13:12,212 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-09 06:13:12,213 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)
[2024-11-09 06:13:12,215 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-09 06:13:12,595 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 06:13:12,601 INFO  L255         TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 25 conjuncts are in the unsatisfiable core
[2024-11-09 06:13:12,610 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-09 06:13:12,629 INFO  L378             Elim1Store]: Elim1 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
[2024-11-09 06:13:13,329 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-09 06:13:13,329 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-09 06:13:13,329 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341213702] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-09 06:13:13,329 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-09 06:13:13,329 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13
[2024-11-09 06:13:13,330 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844542543]
[2024-11-09 06:13:13,330 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-09 06:13:13,330 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-09 06:13:13,331 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-09 06:13:13,331 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-09 06:13:13,331 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156
[2024-11-09 06:13:13,332 INFO  L87              Difference]: Start difference. First operand 367 states and 482 transitions. Second operand  has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-09 06:13:14,226 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-09 06:13:14,226 INFO  L93              Difference]: Finished difference Result 668 states and 879 transitions.
[2024-11-09 06:13:14,227 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-11-09 06:13:14,227 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168
[2024-11-09 06:13:14,228 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-09 06:13:14,230 INFO  L225             Difference]: With dead ends: 668
[2024-11-09 06:13:14,231 INFO  L226             Difference]: Without dead ends: 551
[2024-11-09 06:13:14,232 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380
[2024-11-09 06:13:14,234 INFO  L432           NwaCegarLoop]: 400 mSDtfsCounter, 357 mSDsluCounter, 1929 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 2329 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-09 06:13:14,234 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 2329 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-09 06:13:14,235 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 551 states.
[2024-11-09 06:13:14,250 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 404.
[2024-11-09 06:13:14,251 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 404 states, 399 states have (on average 1.2957393483709274) internal successors, (517), 399 states have internal predecessors, (517), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-09 06:13:14,252 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 523 transitions.
[2024-11-09 06:13:14,253 INFO  L78                 Accepts]: Start accepts. Automaton has 404 states and 523 transitions. Word has length 168
[2024-11-09 06:13:14,253 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-09 06:13:14,253 INFO  L471      AbstractCegarLoop]: Abstraction has 404 states and 523 transitions.
[2024-11-09 06:13:14,253 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-09 06:13:14,254 INFO  L276                IsEmpty]: Start isEmpty. Operand 404 states and 523 transitions.
[2024-11-09 06:13:14,255 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2024-11-09 06:13:14,255 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-09 06:13:14,255 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-09 06:13:14,275 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-09 06:13:14,459 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8
[2024-11-09 06:13:14,460 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-09 06:13:14,461 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-09 06:13:14,461 INFO  L85        PathProgramCache]: Analyzing trace with hash -582378710, now seen corresponding path program 1 times
[2024-11-09 06:13:14,461 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-09 06:13:14,461 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585969645]
[2024-11-09 06:13:14,461 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 06:13:14,462 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-09 06:13:14,660 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 06:13:14,908 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-09 06:13:14,911 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 06:13:14,936 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69
[2024-11-09 06:13:14,937 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 06:13:14,939 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-09 06:13:14,940 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-09 06:13:14,940 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585969645]
[2024-11-09 06:13:14,940 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585969645] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-09 06:13:14,940 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026980713]
[2024-11-09 06:13:14,940 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 06:13:14,940 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-09 06:13:14,940 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-09 06:13:14,941 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)
[2024-11-09 06:13:14,943 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-09 06:13:15,537 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 06:13:15,543 INFO  L255         TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-09 06:13:15,549 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-09 06:13:15,565 INFO  L378             Elim1Store]: Elim1 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
[2024-11-09 06:13:15,611 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-09 06:13:15,612 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-09 06:13:15,612 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026980713] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-09 06:13:15,612 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-09 06:13:15,612 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 8
[2024-11-09 06:13:15,612 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758653190]
[2024-11-09 06:13:15,613 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-09 06:13:15,613 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-09 06:13:15,613 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-09 06:13:15,614 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-09 06:13:15,615 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2024-11-09 06:13:15,615 INFO  L87              Difference]: Start difference. First operand 404 states and 523 transitions. Second operand  has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-09 06:13:15,720 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-09 06:13:15,720 INFO  L93              Difference]: Finished difference Result 769 states and 1001 transitions.
[2024-11-09 06:13:15,721 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-09 06:13:15,721 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 169
[2024-11-09 06:13:15,721 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-09 06:13:15,723 INFO  L225             Difference]: With dead ends: 769
[2024-11-09 06:13:15,723 INFO  L226             Difference]: Without dead ends: 460
[2024-11-09 06:13:15,724 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-11-09 06:13:15,725 INFO  L432           NwaCegarLoop]: 351 mSDtfsCounter, 188 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-09 06:13:15,725 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 1720 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-09 06:13:15,726 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 460 states.
[2024-11-09 06:13:15,740 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 407.
[2024-11-09 06:13:15,741 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 407 states, 401 states have (on average 1.2967581047381547) internal successors, (520), 402 states have internal predecessors, (520), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-09 06:13:15,742 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 527 transitions.
[2024-11-09 06:13:15,743 INFO  L78                 Accepts]: Start accepts. Automaton has 407 states and 527 transitions. Word has length 169
[2024-11-09 06:13:15,743 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-09 06:13:15,743 INFO  L471      AbstractCegarLoop]: Abstraction has 407 states and 527 transitions.
[2024-11-09 06:13:15,743 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-09 06:13:15,744 INFO  L276                IsEmpty]: Start isEmpty. Operand 407 states and 527 transitions.
[2024-11-09 06:13:15,745 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 172
[2024-11-09 06:13:15,745 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-09 06:13:15,745 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-09 06:13:15,765 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-11-09 06:13:15,949 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-09 06:13:15,950 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-09 06:13:15,951 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-09 06:13:15,951 INFO  L85        PathProgramCache]: Analyzing trace with hash 86407948, now seen corresponding path program 1 times
[2024-11-09 06:13:15,951 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-09 06:13:15,952 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171719374]
[2024-11-09 06:13:15,952 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 06:13:15,952 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-09 06:13:16,207 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 06:13:16,481 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-09 06:13:16,486 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 06:13:16,587 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-09 06:13:16,590 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 06:13:16,593 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-09 06:13:16,593 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-09 06:13:16,593 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171719374]
[2024-11-09 06:13:16,593 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171719374] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-09 06:13:16,593 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161850460]
[2024-11-09 06:13:16,594 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 06:13:16,594 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-09 06:13:16,594 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-09 06:13:16,596 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)
[2024-11-09 06:13:16,597 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-09 06:13:17,214 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 06:13:17,227 INFO  L255         TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 41 conjuncts are in the unsatisfiable core
[2024-11-09 06:13:17,233 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-09 06:13:17,245 INFO  L378             Elim1Store]: Elim1 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
[2024-11-09 06:13:28,497 WARN  L286               SmtUtils]: Spent 6.10s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-09 06:13:38,780 WARN  L286               SmtUtils]: Spent 10.28s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-09 06:13:51,797 WARN  L286               SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-09 06:13:57,335 WARN  L286               SmtUtils]: Spent 5.54s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-09 06:14:09,351 WARN  L286               SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-09 06:14:27,726 WARN  L286               SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)