./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-regression/test11.c --full-output --architecture 32bit


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


Checking for memory safety (deref-memtrack)
Using default analysis
Version 9bd2c7ff
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da0f4e-a09e-4f45-83ad-674e7c8c067c/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da0f4e-a09e-4f45-83ad-674e7c8c067c/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da0f4e-a09e-4f45-83ad-674e7c8c067c/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da0f4e-a09e-4f45-83ad-674e7c8c067c/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-regression/test11.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da0f4e-a09e-4f45-83ad-674e7c8c067c/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da0f4e-a09e-4f45-83ad-674e7c8c067c/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eff30860b93e12e0f427a39d6e133ecae4dea669b3383f2efa9b7561bb59ead3
--- Real Ultimate output ---
This is Ultimate 0.2.3-dev-9bd2c7f
[2023-11-19 07:48:22,739 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2023-11-19 07:48:22,868 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da0f4e-a09e-4f45-83ad-674e7c8c067c/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2023-11-19 07:48:22,876 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2023-11-19 07:48:22,877 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-19 07:48:22,915 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-19 07:48:22,916 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-19 07:48:22,917 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-19 07:48:22,918 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-19 07:48:22,919 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-19 07:48:22,920 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-19 07:48:22,920 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-19 07:48:22,921 INFO  L153        SettingsManager]:  * Use SBE=true
[2023-11-19 07:48:22,925 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-19 07:48:22,926 INFO  L153        SettingsManager]:  * sizeof long=4
[2023-11-19 07:48:22,927 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-19 07:48:22,927 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2023-11-19 07:48:22,927 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-19 07:48:22,928 INFO  L153        SettingsManager]:  * Check for the main procedure if all allocated memory was freed=true
[2023-11-19 07:48:22,928 INFO  L153        SettingsManager]:  * Bitprecise bitfields=true
[2023-11-19 07:48:22,929 INFO  L153        SettingsManager]:  * SV-COMP memtrack compatibility mode=true
[2023-11-19 07:48:22,929 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-19 07:48:22,930 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2023-11-19 07:48:22,931 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2023-11-19 07:48:22,933 INFO  L153        SettingsManager]:  * sizeof long double=12
[2023-11-19 07:48:22,934 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2023-11-19 07:48:22,934 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-19 07:48:22,935 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-19 07:48:22,935 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-19 07:48:22,936 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:48:22,937 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-19 07:48:22,937 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-19 07:48:22,938 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-19 07:48:22,938 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-19 07:48:22,938 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-19 07:48:22,938 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-11-19 07:48:22,938 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-19 07:48:22,939 INFO  L153        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-19 07:48:22,939 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da0f4e-a09e-4f45-83ad-674e7c8c067c/bin/uautomizer-verify-uCwYo4JHxu/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da0f4e-a09e-4f45-83ad-674e7c8c067c/bin/uautomizer-verify-uCwYo4JHxu
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 valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )


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 -> eff30860b93e12e0f427a39d6e133ecae4dea669b3383f2efa9b7561bb59ead3
[2023-11-19 07:48:23,281 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-19 07:48:23,309 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-19 07:48:23,312 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-19 07:48:23,313 INFO  L270        PluginConnector]: Initializing CDTParser...
[2023-11-19 07:48:23,314 INFO  L274        PluginConnector]: CDTParser initialized
[2023-11-19 07:48:23,315 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da0f4e-a09e-4f45-83ad-674e7c8c067c/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/ldv-regression/test11.c
[2023-11-19 07:48:26,347 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2023-11-19 07:48:26,527 INFO  L384              CDTParser]: Found 1 translation units.
[2023-11-19 07:48:26,527 INFO  L180              CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da0f4e-a09e-4f45-83ad-674e7c8c067c/sv-benchmarks/c/ldv-regression/test11.c
[2023-11-19 07:48:26,537 INFO  L427              CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da0f4e-a09e-4f45-83ad-674e7c8c067c/bin/uautomizer-verify-uCwYo4JHxu/data/1994d8cd0/4ae95dbf5ba4410eb905af59337013d2/FLAGf64c6189d
[2023-11-19 07:48:26,555 INFO  L435              CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da0f4e-a09e-4f45-83ad-674e7c8c067c/bin/uautomizer-verify-uCwYo4JHxu/data/1994d8cd0/4ae95dbf5ba4410eb905af59337013d2
[2023-11-19 07:48:26,558 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-19 07:48:26,559 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-19 07:48:26,561 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-19 07:48:26,561 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-19 07:48:26,567 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-19 07:48:26,568 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:48:26" (1/1) ...
[2023-11-19 07:48:26,569 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cb64dcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:26, skipping insertion in model container
[2023-11-19 07:48:26,569 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:48:26" (1/1) ...
[2023-11-19 07:48:26,590 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2023-11-19 07:48:26,781 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:48:26,800 INFO  L202         MainTranslator]: Completed pre-run
[2023-11-19 07:48:26,825 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:48:26,837 INFO  L206         MainTranslator]: Completed translation
[2023-11-19 07:48:26,838 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:26 WrapperNode
[2023-11-19 07:48:26,838 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-19 07:48:26,839 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-19 07:48:26,839 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-19 07:48:26,839 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-19 07:48:26,847 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:26" (1/1) ...
[2023-11-19 07:48:26,853 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:26" (1/1) ...
[2023-11-19 07:48:26,874 INFO  L138                Inliner]: procedures = 15, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77
[2023-11-19 07:48:26,874 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-19 07:48:26,875 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-19 07:48:26,875 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-19 07:48:26,875 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2023-11-19 07:48:26,883 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:26" (1/1) ...
[2023-11-19 07:48:26,884 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:26" (1/1) ...
[2023-11-19 07:48:26,886 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:26" (1/1) ...
[2023-11-19 07:48:26,887 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:26" (1/1) ...
[2023-11-19 07:48:26,892 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:26" (1/1) ...
[2023-11-19 07:48:26,894 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:26" (1/1) ...
[2023-11-19 07:48:26,895 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:26" (1/1) ...
[2023-11-19 07:48:26,896 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:26" (1/1) ...
[2023-11-19 07:48:26,901 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-19 07:48:26,902 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-19 07:48:26,902 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2023-11-19 07:48:26,902 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2023-11-19 07:48:26,903 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:26" (1/1) ...
[2023-11-19 07:48:26,908 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:48:26,922 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da0f4e-a09e-4f45-83ad-674e7c8c067c/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:48:26,946 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da0f4e-a09e-4f45-83ad-674e7c8c067c/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-19 07:48:26,968 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da0f4e-a09e-4f45-83ad-674e7c8c067c/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-19 07:48:26,983 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-19 07:48:26,983 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-19 07:48:26,984 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-19 07:48:26,984 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-11-19 07:48:26,984 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-19 07:48:26,984 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-19 07:48:26,984 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-11-19 07:48:26,984 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-19 07:48:27,050 INFO  L236             CfgBuilder]: Building ICFG
[2023-11-19 07:48:27,052 INFO  L262             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-19 07:48:27,300 INFO  L277             CfgBuilder]: Performing block encoding
[2023-11-19 07:48:27,309 INFO  L297             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-19 07:48:27,309 INFO  L302             CfgBuilder]: Removed 0 assume(true) statements.
[2023-11-19 07:48:27,312 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:48:27 BoogieIcfgContainer
[2023-11-19 07:48:27,312 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-19 07:48:27,315 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-19 07:48:27,315 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2023-11-19 07:48:27,318 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2023-11-19 07:48:27,319 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:48:26" (1/3) ...
[2023-11-19 07:48:27,319 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5988a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:48:27, skipping insertion in model container
[2023-11-19 07:48:27,320 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:26" (2/3) ...
[2023-11-19 07:48:27,320 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5988a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:48:27, skipping insertion in model container
[2023-11-19 07:48:27,320 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:48:27" (3/3) ...
[2023-11-19 07:48:27,321 INFO  L112   eAbstractionObserver]: Analyzing ICFG test11.c
[2023-11-19 07:48:27,342 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-19 07:48:27,342 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations.
[2023-11-19 07:48:27,393 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-19 07:48:27,400 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@10207068, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-19 07:48:27,401 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 14 error locations.
[2023-11-19 07:48:27,405 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 37 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:27,411 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2023-11-19 07:48:27,411 INFO  L187           NwaCegarLoop]: Found error trace
[2023-11-19 07:48:27,412 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1]
[2023-11-19 07:48:27,413 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] ===
[2023-11-19 07:48:27,418 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:48:27,418 INFO  L85        PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times
[2023-11-19 07:48:27,428 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:48:27,431 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574123111]
[2023-11-19 07:48:27,431 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:48:27,432 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:48:27,553 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:48:27,771 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:48:27,771 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:48:27,772 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574123111]
[2023-11-19 07:48:27,773 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574123111] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:48:27,773 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:48:27,773 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:48:27,775 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228040393]
[2023-11-19 07:48:27,780 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:48:27,786 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:48:27,787 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:48:27,819 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:48:27,820 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:48:27,822 INFO  L87              Difference]: Start difference. First operand  has 37 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:27,881 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:48:27,881 INFO  L93              Difference]: Finished difference Result 35 states and 37 transitions.
[2023-11-19 07:48:27,882 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-19 07:48:27,883 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3
[2023-11-19 07:48:27,884 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:48:27,891 INFO  L225             Difference]: With dead ends: 35
[2023-11-19 07:48:27,894 INFO  L226             Difference]: Without dead ends: 33
[2023-11-19 07:48:27,896 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:48:27,900 INFO  L413           NwaCegarLoop]: 22 mSDtfsCounter, 31 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:48:27,901 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 24 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:48:27,921 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 33 states.
[2023-11-19 07:48:27,932 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33.
[2023-11-19 07:48:27,933 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 33 states, 20 states have (on average 1.75) internal successors, (35), 32 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:27,935 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions.
[2023-11-19 07:48:27,936 INFO  L78                 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 3
[2023-11-19 07:48:27,936 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:48:27,936 INFO  L495      AbstractCegarLoop]: Abstraction has 33 states and 35 transitions.
[2023-11-19 07:48:27,937 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:27,937 INFO  L276                IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions.
[2023-11-19 07:48:27,937 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2023-11-19 07:48:27,937 INFO  L187           NwaCegarLoop]: Found error trace
[2023-11-19 07:48:27,937 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1]
[2023-11-19 07:48:27,938 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-19 07:48:27,938 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] ===
[2023-11-19 07:48:27,939 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:48:27,939 INFO  L85        PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times
[2023-11-19 07:48:27,939 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:48:27,940 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481086662]
[2023-11-19 07:48:27,940 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:48:27,940 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:48:27,986 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:48:28,228 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:48:28,228 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:48:28,229 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481086662]
[2023-11-19 07:48:28,229 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481086662] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:48:28,229 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:48:28,229 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:48:28,230 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827429963]
[2023-11-19 07:48:28,230 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:48:28,231 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:48:28,231 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:48:28,232 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:48:28,232 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:48:28,233 INFO  L87              Difference]: Start difference. First operand 33 states and 35 transitions. Second operand  has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:28,275 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:48:28,275 INFO  L93              Difference]: Finished difference Result 32 states and 34 transitions.
[2023-11-19 07:48:28,275 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-19 07:48:28,276 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3
[2023-11-19 07:48:28,276 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:48:28,279 INFO  L225             Difference]: With dead ends: 32
[2023-11-19 07:48:28,279 INFO  L226             Difference]: Without dead ends: 32
[2023-11-19 07:48:28,282 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:48:28,284 INFO  L413           NwaCegarLoop]: 15 mSDtfsCounter, 62 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:48:28,285 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 15 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:48:28,286 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2023-11-19 07:48:28,288 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32.
[2023-11-19 07:48:28,289 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 32 states, 20 states have (on average 1.7) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:28,290 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions.
[2023-11-19 07:48:28,290 INFO  L78                 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 3
[2023-11-19 07:48:28,290 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:48:28,290 INFO  L495      AbstractCegarLoop]: Abstraction has 32 states and 34 transitions.
[2023-11-19 07:48:28,291 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:28,291 INFO  L276                IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions.
[2023-11-19 07:48:28,291 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2023-11-19 07:48:28,291 INFO  L187           NwaCegarLoop]: Found error trace
[2023-11-19 07:48:28,292 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2023-11-19 07:48:28,294 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-19 07:48:28,295 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] ===
[2023-11-19 07:48:28,295 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:48:28,296 INFO  L85        PathProgramCache]: Analyzing trace with hash 28691810, now seen corresponding path program 1 times
[2023-11-19 07:48:28,296 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:48:28,296 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482136477]
[2023-11-19 07:48:28,296 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:48:28,297 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:48:28,316 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:48:28,445 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:48:28,445 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:48:28,445 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482136477]
[2023-11-19 07:48:28,446 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482136477] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:48:28,446 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:48:28,446 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-19 07:48:28,446 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719964886]
[2023-11-19 07:48:28,446 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:48:28,447 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:48:28,447 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:48:28,448 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:48:28,448 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:48:28,448 INFO  L87              Difference]: Start difference. First operand 32 states and 34 transitions. Second operand  has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:28,493 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:48:28,493 INFO  L93              Difference]: Finished difference Result 31 states and 33 transitions.
[2023-11-19 07:48:28,494 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-19 07:48:28,494 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5
[2023-11-19 07:48:28,494 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:48:28,495 INFO  L225             Difference]: With dead ends: 31
[2023-11-19 07:48:28,495 INFO  L226             Difference]: Without dead ends: 31
[2023-11-19 07:48:28,496 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:48:28,497 INFO  L413           NwaCegarLoop]: 19 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:48:28,498 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 19 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:48:28,499 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 31 states.
[2023-11-19 07:48:28,501 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31.
[2023-11-19 07:48:28,502 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31 states, 20 states have (on average 1.65) internal successors, (33), 30 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:28,502 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions.
[2023-11-19 07:48:28,503 INFO  L78                 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 5
[2023-11-19 07:48:28,503 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:48:28,503 INFO  L495      AbstractCegarLoop]: Abstraction has 31 states and 33 transitions.
[2023-11-19 07:48:28,503 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:28,504 INFO  L276                IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions.
[2023-11-19 07:48:28,506 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2023-11-19 07:48:28,507 INFO  L187           NwaCegarLoop]: Found error trace
[2023-11-19 07:48:28,507 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2023-11-19 07:48:28,508 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-19 07:48:28,514 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] ===
[2023-11-19 07:48:28,515 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:48:28,515 INFO  L85        PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times
[2023-11-19 07:48:28,515 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:48:28,516 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671820706]
[2023-11-19 07:48:28,516 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:48:28,516 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:48:28,537 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:48:28,681 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:48:28,682 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:48:28,682 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671820706]
[2023-11-19 07:48:28,683 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671820706] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:48:28,683 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:48:28,683 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-19 07:48:28,683 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535145613]
[2023-11-19 07:48:28,684 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:48:28,684 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:48:28,684 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:48:28,685 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:48:28,685 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:48:28,686 INFO  L87              Difference]: Start difference. First operand 31 states and 33 transitions. Second operand  has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:28,709 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:48:28,710 INFO  L93              Difference]: Finished difference Result 30 states and 32 transitions.
[2023-11-19 07:48:28,710 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-19 07:48:28,710 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5
[2023-11-19 07:48:28,728 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:48:28,732 INFO  L225             Difference]: With dead ends: 30
[2023-11-19 07:48:28,733 INFO  L226             Difference]: Without dead ends: 30
[2023-11-19 07:48:28,733 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:48:28,734 INFO  L413           NwaCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:48:28,735 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 20 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:48:28,736 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2023-11-19 07:48:28,738 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30.
[2023-11-19 07:48:28,738 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 30 states, 20 states have (on average 1.6) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:28,739 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions.
[2023-11-19 07:48:28,739 INFO  L78                 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 5
[2023-11-19 07:48:28,739 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:48:28,740 INFO  L495      AbstractCegarLoop]: Abstraction has 30 states and 32 transitions.
[2023-11-19 07:48:28,740 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:28,740 INFO  L276                IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions.
[2023-11-19 07:48:28,740 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2023-11-19 07:48:28,741 INFO  L187           NwaCegarLoop]: Found error trace
[2023-11-19 07:48:28,741 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:48:28,741 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-19 07:48:28,741 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] ===
[2023-11-19 07:48:28,742 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:48:28,742 INFO  L85        PathProgramCache]: Analyzing trace with hash 1056639248, now seen corresponding path program 1 times
[2023-11-19 07:48:28,742 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:48:28,743 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117706783]
[2023-11-19 07:48:28,743 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:48:28,743 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:48:28,777 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:48:28,904 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:48:28,904 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:48:28,904 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117706783]
[2023-11-19 07:48:28,905 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117706783] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:48:28,905 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:48:28,905 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-19 07:48:28,905 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445272323]
[2023-11-19 07:48:28,906 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:48:28,907 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-19 07:48:28,907 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:48:28,908 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-19 07:48:28,909 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2023-11-19 07:48:28,909 INFO  L87              Difference]: Start difference. First operand 30 states and 32 transitions. Second operand  has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:29,007 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:48:29,009 INFO  L93              Difference]: Finished difference Result 29 states and 31 transitions.
[2023-11-19 07:48:29,009 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-11-19 07:48:29,009 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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 10
[2023-11-19 07:48:29,009 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:48:29,012 INFO  L225             Difference]: With dead ends: 29
[2023-11-19 07:48:29,012 INFO  L226             Difference]: Without dead ends: 29
[2023-11-19 07:48:29,012 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2023-11-19 07:48:29,019 INFO  L413           NwaCegarLoop]: 16 mSDtfsCounter, 93 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:48:29,019 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 18 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:48:29,023 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 29 states.
[2023-11-19 07:48:29,031 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29.
[2023-11-19 07:48:29,031 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 29 states, 20 states have (on average 1.55) internal successors, (31), 28 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:29,034 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions.
[2023-11-19 07:48:29,034 INFO  L78                 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 10
[2023-11-19 07:48:29,034 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:48:29,034 INFO  L495      AbstractCegarLoop]: Abstraction has 29 states and 31 transitions.
[2023-11-19 07:48:29,035 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:29,035 INFO  L276                IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions.
[2023-11-19 07:48:29,035 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2023-11-19 07:48:29,036 INFO  L187           NwaCegarLoop]: Found error trace
[2023-11-19 07:48:29,036 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:48:29,036 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-19 07:48:29,036 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] ===
[2023-11-19 07:48:29,037 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:48:29,037 INFO  L85        PathProgramCache]: Analyzing trace with hash 1056639249, now seen corresponding path program 1 times
[2023-11-19 07:48:29,037 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:48:29,037 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537094953]
[2023-11-19 07:48:29,037 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:48:29,038 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:48:29,074 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:48:29,487 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:48:29,487 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:48:29,488 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537094953]
[2023-11-19 07:48:29,488 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537094953] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:48:29,488 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:48:29,488 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-19 07:48:29,488 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25745463]
[2023-11-19 07:48:29,488 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:48:29,489 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-19 07:48:29,489 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:48:29,490 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-19 07:48:29,491 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2023-11-19 07:48:29,491 INFO  L87              Difference]: Start difference. First operand 29 states and 31 transitions. Second operand  has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:29,659 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:48:29,660 INFO  L93              Difference]: Finished difference Result 28 states and 30 transitions.
[2023-11-19 07:48:29,660 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-19 07:48:29,660 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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 10
[2023-11-19 07:48:29,661 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:48:29,661 INFO  L225             Difference]: With dead ends: 28
[2023-11-19 07:48:29,662 INFO  L226             Difference]: Without dead ends: 28
[2023-11-19 07:48:29,663 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110
[2023-11-19 07:48:29,666 INFO  L413           NwaCegarLoop]: 13 mSDtfsCounter, 98 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:48:29,669 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 15 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:48:29,674 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 28 states.
[2023-11-19 07:48:29,678 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28.
[2023-11-19 07:48:29,679 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28 states, 20 states have (on average 1.5) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:29,681 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions.
[2023-11-19 07:48:29,682 INFO  L78                 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 10
[2023-11-19 07:48:29,683 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:48:29,683 INFO  L495      AbstractCegarLoop]: Abstraction has 28 states and 30 transitions.
[2023-11-19 07:48:29,683 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:29,684 INFO  L276                IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions.
[2023-11-19 07:48:29,686 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2023-11-19 07:48:29,686 INFO  L187           NwaCegarLoop]: Found error trace
[2023-11-19 07:48:29,686 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:48:29,686 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-19 07:48:29,687 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] ===
[2023-11-19 07:48:29,687 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:48:29,687 INFO  L85        PathProgramCache]: Analyzing trace with hash 1056637870, now seen corresponding path program 1 times
[2023-11-19 07:48:29,688 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:48:29,688 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10661624]
[2023-11-19 07:48:29,688 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:48:29,688 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:48:29,702 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:48:29,719 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:48:29,719 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:48:29,719 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10661624]
[2023-11-19 07:48:29,720 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10661624] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:48:29,720 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:48:29,720 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:48:29,720 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212515418]
[2023-11-19 07:48:29,720 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:48:29,721 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:48:29,721 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:48:29,721 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:48:29,722 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:48:29,722 INFO  L87              Difference]: Start difference. First operand 28 states and 30 transitions. Second operand  has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:29,739 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:48:29,739 INFO  L93              Difference]: Finished difference Result 29 states and 31 transitions.
[2023-11-19 07:48:29,740 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-19 07:48:29,740 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10
[2023-11-19 07:48:29,740 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:48:29,741 INFO  L225             Difference]: With dead ends: 29
[2023-11-19 07:48:29,741 INFO  L226             Difference]: Without dead ends: 29
[2023-11-19 07:48:29,741 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:48:29,745 INFO  L413           NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:48:29,745 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:48:29,747 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 29 states.
[2023-11-19 07:48:29,751 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29.
[2023-11-19 07:48:29,752 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 29 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 28 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:29,754 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions.
[2023-11-19 07:48:29,755 INFO  L78                 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 10
[2023-11-19 07:48:29,755 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:48:29,755 INFO  L495      AbstractCegarLoop]: Abstraction has 29 states and 31 transitions.
[2023-11-19 07:48:29,757 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:29,757 INFO  L276                IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions.
[2023-11-19 07:48:29,758 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2023-11-19 07:48:29,758 INFO  L187           NwaCegarLoop]: Found error trace
[2023-11-19 07:48:29,773 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:48:29,774 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-19 07:48:29,774 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] ===
[2023-11-19 07:48:29,775 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:48:29,775 INFO  L85        PathProgramCache]: Analyzing trace with hash -1603921686, now seen corresponding path program 1 times
[2023-11-19 07:48:29,775 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:48:29,776 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992375345]
[2023-11-19 07:48:29,776 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:48:29,776 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:48:29,789 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:48:29,829 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:48:29,829 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:48:29,830 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992375345]
[2023-11-19 07:48:29,830 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992375345] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:48:29,830 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:48:29,830 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:48:29,830 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934552128]
[2023-11-19 07:48:29,831 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:48:29,831 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:48:29,831 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:48:29,832 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:48:29,832 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:48:29,832 INFO  L87              Difference]: Start difference. First operand 29 states and 31 transitions. Second operand  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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)
[2023-11-19 07:48:29,881 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:48:29,881 INFO  L93              Difference]: Finished difference Result 40 states and 43 transitions.
[2023-11-19 07:48:29,882 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-19 07:48:29,882 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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
[2023-11-19 07:48:29,882 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:48:29,883 INFO  L225             Difference]: With dead ends: 40
[2023-11-19 07:48:29,883 INFO  L226             Difference]: Without dead ends: 40
[2023-11-19 07:48:29,883 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:48:29,884 INFO  L413           NwaCegarLoop]: 28 mSDtfsCounter, 33 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:48:29,885 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 43 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:48:29,886 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 40 states.
[2023-11-19 07:48:29,888 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28.
[2023-11-19 07:48:29,888 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:29,889 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions.
[2023-11-19 07:48:29,889 INFO  L78                 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 11
[2023-11-19 07:48:29,889 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:48:29,889 INFO  L495      AbstractCegarLoop]: Abstraction has 28 states and 30 transitions.
[2023-11-19 07:48:29,890 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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)
[2023-11-19 07:48:29,890 INFO  L276                IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions.
[2023-11-19 07:48:29,890 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2023-11-19 07:48:29,891 INFO  L187           NwaCegarLoop]: Found error trace
[2023-11-19 07:48:29,891 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:48:29,891 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-19 07:48:29,891 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] ===
[2023-11-19 07:48:29,892 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:48:29,892 INFO  L85        PathProgramCache]: Analyzing trace with hash -1603921685, now seen corresponding path program 1 times
[2023-11-19 07:48:29,892 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:48:29,893 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234788669]
[2023-11-19 07:48:29,893 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:48:29,893 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:48:29,909 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:48:30,036 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:48:30,036 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:48:30,037 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234788669]
[2023-11-19 07:48:30,037 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234788669] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:48:30,037 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:48:30,037 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:48:30,038 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956391013]
[2023-11-19 07:48:30,038 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:48:30,038 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-19 07:48:30,039 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:48:30,039 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-19 07:48:30,040 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2023-11-19 07:48:30,040 INFO  L87              Difference]: Start difference. First operand 28 states and 30 transitions. Second operand  has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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)
[2023-11-19 07:48:30,118 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:48:30,118 INFO  L93              Difference]: Finished difference Result 41 states and 43 transitions.
[2023-11-19 07:48:30,119 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-19 07:48:30,119 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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
[2023-11-19 07:48:30,119 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:48:30,120 INFO  L225             Difference]: With dead ends: 41
[2023-11-19 07:48:30,120 INFO  L226             Difference]: Without dead ends: 41
[2023-11-19 07:48:30,120 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2023-11-19 07:48:30,121 INFO  L413           NwaCegarLoop]: 27 mSDtfsCounter, 80 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:48:30,122 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 45 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:48:30,123 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 41 states.
[2023-11-19 07:48:30,124 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27.
[2023-11-19 07:48:30,125 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 27 states, 21 states have (on average 1.380952380952381) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:30,125 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions.
[2023-11-19 07:48:30,125 INFO  L78                 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 11
[2023-11-19 07:48:30,126 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:48:30,126 INFO  L495      AbstractCegarLoop]: Abstraction has 27 states and 29 transitions.
[2023-11-19 07:48:30,126 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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)
[2023-11-19 07:48:30,126 INFO  L276                IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions.
[2023-11-19 07:48:30,127 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2023-11-19 07:48:30,127 INFO  L187           NwaCegarLoop]: Found error trace
[2023-11-19 07:48:30,127 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:48:30,127 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-19 07:48:30,128 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] ===
[2023-11-19 07:48:30,128 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:48:30,128 INFO  L85        PathProgramCache]: Analyzing trace with hash -1603965928, now seen corresponding path program 1 times
[2023-11-19 07:48:30,128 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:48:30,129 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891989891]
[2023-11-19 07:48:30,129 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:48:30,129 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:48:30,139 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:48:30,175 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:48:30,175 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:48:30,176 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891989891]
[2023-11-19 07:48:30,176 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891989891] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:48:30,176 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:48:30,176 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:48:30,176 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739012113]
[2023-11-19 07:48:30,176 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:48:30,177 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:48:30,177 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:48:30,177 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:48:30,178 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:48:30,178 INFO  L87              Difference]: Start difference. First operand 27 states and 29 transitions. Second operand  has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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)
[2023-11-19 07:48:30,197 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:48:30,197 INFO  L93              Difference]: Finished difference Result 26 states and 27 transitions.
[2023-11-19 07:48:30,198 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-19 07:48:30,198 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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
[2023-11-19 07:48:30,198 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:48:30,199 INFO  L225             Difference]: With dead ends: 26
[2023-11-19 07:48:30,199 INFO  L226             Difference]: Without dead ends: 26
[2023-11-19 07:48:30,199 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:48:30,200 INFO  L413           NwaCegarLoop]: 22 mSDtfsCounter, 27 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:48:30,200 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 36 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:48:30,201 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26 states.
[2023-11-19 07:48:30,202 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26.
[2023-11-19 07:48:30,203 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 26 states, 20 states have (on average 1.35) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:30,203 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions.
[2023-11-19 07:48:30,203 INFO  L78                 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 11
[2023-11-19 07:48:30,203 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:48:30,204 INFO  L495      AbstractCegarLoop]: Abstraction has 26 states and 27 transitions.
[2023-11-19 07:48:30,204 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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)
[2023-11-19 07:48:30,204 INFO  L276                IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions.
[2023-11-19 07:48:30,204 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2023-11-19 07:48:30,205 INFO  L187           NwaCegarLoop]: Found error trace
[2023-11-19 07:48:30,205 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:48:30,205 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-19 07:48:30,205 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] ===
[2023-11-19 07:48:30,206 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:48:30,206 INFO  L85        PathProgramCache]: Analyzing trace with hash 1818313426, now seen corresponding path program 1 times
[2023-11-19 07:48:30,206 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:48:30,206 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075298544]
[2023-11-19 07:48:30,206 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:48:30,207 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:48:30,216 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:48:30,252 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:48:30,252 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:48:30,252 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075298544]
[2023-11-19 07:48:30,253 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075298544] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:48:30,253 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:48:30,253 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:48:30,253 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812223010]
[2023-11-19 07:48:30,253 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:48:30,254 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:48:30,254 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:48:30,254 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:48:30,255 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:48:30,255 INFO  L87              Difference]: Start difference. First operand 26 states and 27 transitions. Second operand  has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:30,275 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:48:30,276 INFO  L93              Difference]: Finished difference Result 26 states and 26 transitions.
[2023-11-19 07:48:30,276 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-19 07:48:30,276 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12
[2023-11-19 07:48:30,277 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:48:30,277 INFO  L225             Difference]: With dead ends: 26
[2023-11-19 07:48:30,277 INFO  L226             Difference]: Without dead ends: 26
[2023-11-19 07:48:30,277 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:48:30,278 INFO  L413           NwaCegarLoop]: 22 mSDtfsCounter, 22 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:48:30,279 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 44 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:48:30,279 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26 states.
[2023-11-19 07:48:30,280 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26.
[2023-11-19 07:48:30,281 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 26 states, 20 states have (on average 1.3) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:30,281 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions.
[2023-11-19 07:48:30,281 INFO  L78                 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 12
[2023-11-19 07:48:30,282 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:48:30,282 INFO  L495      AbstractCegarLoop]: Abstraction has 26 states and 26 transitions.
[2023-11-19 07:48:30,282 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:30,282 INFO  L276                IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions.
[2023-11-19 07:48:30,283 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2023-11-19 07:48:30,283 INFO  L187           NwaCegarLoop]: Found error trace
[2023-11-19 07:48:30,283 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:48:30,283 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-19 07:48:30,284 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] ===
[2023-11-19 07:48:30,284 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:48:30,284 INFO  L85        PathProgramCache]: Analyzing trace with hash 1551514479, now seen corresponding path program 1 times
[2023-11-19 07:48:30,284 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:48:30,285 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280085345]
[2023-11-19 07:48:30,285 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:48:30,285 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:48:30,296 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:48:30,336 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:48:30,337 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:48:30,337 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280085345]
[2023-11-19 07:48:30,337 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280085345] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:48:30,337 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:48:30,337 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:48:30,337 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198488750]
[2023-11-19 07:48:30,338 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:48:30,338 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:48:30,338 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:48:30,339 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:48:30,339 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:48:30,339 INFO  L87              Difference]: Start difference. First operand 26 states and 26 transitions. Second operand  has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:30,361 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:48:30,361 INFO  L93              Difference]: Finished difference Result 25 states and 25 transitions.
[2023-11-19 07:48:30,361 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-19 07:48:30,362 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15
[2023-11-19 07:48:30,362 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:48:30,363 INFO  L225             Difference]: With dead ends: 25
[2023-11-19 07:48:30,363 INFO  L226             Difference]: Without dead ends: 25
[2023-11-19 07:48:30,363 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:48:30,364 INFO  L413           NwaCegarLoop]: 15 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:48:30,364 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 15 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:48:30,366 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 25 states.
[2023-11-19 07:48:30,370 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25.
[2023-11-19 07:48:30,370 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 25 states, 20 states have (on average 1.25) internal successors, (25), 24 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:30,371 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions.
[2023-11-19 07:48:30,371 INFO  L78                 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 15
[2023-11-19 07:48:30,371 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:48:30,372 INFO  L495      AbstractCegarLoop]: Abstraction has 25 states and 25 transitions.
[2023-11-19 07:48:30,372 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:30,372 INFO  L276                IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions.
[2023-11-19 07:48:30,372 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2023-11-19 07:48:30,373 INFO  L187           NwaCegarLoop]: Found error trace
[2023-11-19 07:48:30,373 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:48:30,373 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-11-19 07:48:30,373 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] ===
[2023-11-19 07:48:30,374 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:48:30,374 INFO  L85        PathProgramCache]: Analyzing trace with hash 1551514480, now seen corresponding path program 1 times
[2023-11-19 07:48:30,374 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:48:30,374 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938961620]
[2023-11-19 07:48:30,375 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:48:30,375 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:48:30,395 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:48:30,471 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:48:30,472 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:48:30,472 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938961620]
[2023-11-19 07:48:30,472 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938961620] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:48:30,472 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:48:30,472 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:48:30,473 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482140183]
[2023-11-19 07:48:30,473 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:48:30,473 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:48:30,473 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:48:30,474 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:48:30,474 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:48:30,475 INFO  L87              Difference]: Start difference. First operand 25 states and 25 transitions. Second operand  has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:30,493 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:48:30,494 INFO  L93              Difference]: Finished difference Result 24 states and 24 transitions.
[2023-11-19 07:48:30,494 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-19 07:48:30,494 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15
[2023-11-19 07:48:30,495 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:48:30,496 INFO  L225             Difference]: With dead ends: 24
[2023-11-19 07:48:30,497 INFO  L226             Difference]: Without dead ends: 24
[2023-11-19 07:48:30,497 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:48:30,500 INFO  L413           NwaCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:48:30,500 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 16 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:48:30,501 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24 states.
[2023-11-19 07:48:30,508 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24.
[2023-11-19 07:48:30,508 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 24 states, 20 states have (on average 1.2) internal successors, (24), 23 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:30,509 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions.
[2023-11-19 07:48:30,509 INFO  L78                 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 15
[2023-11-19 07:48:30,509 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:48:30,509 INFO  L495      AbstractCegarLoop]: Abstraction has 24 states and 24 transitions.
[2023-11-19 07:48:30,510 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:30,510 INFO  L276                IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions.
[2023-11-19 07:48:30,511 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2023-11-19 07:48:30,511 INFO  L187           NwaCegarLoop]: Found error trace
[2023-11-19 07:48:30,512 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:48:30,512 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-19 07:48:30,512 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] ===
[2023-11-19 07:48:30,513 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:48:30,513 INFO  L85        PathProgramCache]: Analyzing trace with hash 852307063, now seen corresponding path program 1 times
[2023-11-19 07:48:30,513 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:48:30,513 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827080336]
[2023-11-19 07:48:30,513 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:48:30,514 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:48:30,527 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:48:30,666 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:48:30,666 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:48:30,666 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827080336]
[2023-11-19 07:48:30,666 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827080336] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:48:30,667 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:48:30,667 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2023-11-19 07:48:30,667 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206043463]
[2023-11-19 07:48:30,667 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:48:30,668 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-19 07:48:30,668 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:48:30,668 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-19 07:48:30,668 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2023-11-19 07:48:30,669 INFO  L87              Difference]: Start difference. First operand 24 states and 24 transitions. Second operand  has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:30,769 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:48:30,769 INFO  L93              Difference]: Finished difference Result 24 states and 23 transitions.
[2023-11-19 07:48:30,770 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-19 07:48:30,770 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 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 16
[2023-11-19 07:48:30,770 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:48:30,771 INFO  L225             Difference]: With dead ends: 24
[2023-11-19 07:48:30,771 INFO  L226             Difference]: Without dead ends: 24
[2023-11-19 07:48:30,771 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110
[2023-11-19 07:48:30,772 INFO  L413           NwaCegarLoop]: 16 mSDtfsCounter, 15 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:48:30,772 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 77 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:48:30,774 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24 states.
[2023-11-19 07:48:30,785 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24.
[2023-11-19 07:48:30,785 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 24 states, 20 states have (on average 1.15) internal successors, (23), 23 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:30,786 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions.
[2023-11-19 07:48:30,787 INFO  L78                 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 16
[2023-11-19 07:48:30,788 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:48:30,789 INFO  L495      AbstractCegarLoop]: Abstraction has 24 states and 23 transitions.
[2023-11-19 07:48:30,789 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:30,789 INFO  L276                IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions.
[2023-11-19 07:48:30,791 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2023-11-19 07:48:30,791 INFO  L187           NwaCegarLoop]: Found error trace
[2023-11-19 07:48:30,791 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:48:30,792 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-11-19 07:48:30,792 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] ===
[2023-11-19 07:48:30,793 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:48:30,793 INFO  L85        PathProgramCache]: Analyzing trace with hash 852308604, now seen corresponding path program 1 times
[2023-11-19 07:48:30,793 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:48:30,793 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682915466]
[2023-11-19 07:48:30,793 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:48:30,794 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:48:30,809 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:48:30,863 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:48:30,863 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:48:30,864 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682915466]
[2023-11-19 07:48:30,864 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682915466] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:48:30,864 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:48:30,864 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:48:30,864 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009870975]
[2023-11-19 07:48:30,865 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:48:30,865 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:48:30,865 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:48:30,866 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:48:30,866 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:48:30,866 INFO  L87              Difference]: Start difference. First operand 24 states and 23 transitions. Second operand  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:30,891 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:48:30,891 INFO  L93              Difference]: Finished difference Result 23 states and 22 transitions.
[2023-11-19 07:48:30,892 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-19 07:48:30,892 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16
[2023-11-19 07:48:30,892 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:48:30,893 INFO  L225             Difference]: With dead ends: 23
[2023-11-19 07:48:30,893 INFO  L226             Difference]: Without dead ends: 23
[2023-11-19 07:48:30,893 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:48:30,894 INFO  L413           NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:48:30,895 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 13 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:48:30,895 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23 states.
[2023-11-19 07:48:30,896 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23.
[2023-11-19 07:48:30,896 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:30,897 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions.
[2023-11-19 07:48:30,897 INFO  L78                 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 16
[2023-11-19 07:48:30,897 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:48:30,897 INFO  L495      AbstractCegarLoop]: Abstraction has 23 states and 22 transitions.
[2023-11-19 07:48:30,898 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:30,898 INFO  L276                IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions.
[2023-11-19 07:48:30,898 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2023-11-19 07:48:30,898 INFO  L187           NwaCegarLoop]: Found error trace
[2023-11-19 07:48:30,899 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:48:30,899 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-11-19 07:48:30,899 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] ===
[2023-11-19 07:48:30,900 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:48:30,900 INFO  L85        PathProgramCache]: Analyzing trace with hash 852308605, now seen corresponding path program 1 times
[2023-11-19 07:48:30,900 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:48:30,900 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240327914]
[2023-11-19 07:48:30,900 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:48:30,901 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:48:30,917 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:48:31,008 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:48:31,009 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:48:31,009 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240327914]
[2023-11-19 07:48:31,009 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240327914] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:48:31,009 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:48:31,009 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:48:31,009 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107766110]
[2023-11-19 07:48:31,010 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:48:31,010 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:48:31,010 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:48:31,011 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:48:31,011 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:48:31,011 INFO  L87              Difference]: Start difference. First operand 23 states and 22 transitions. Second operand  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:31,027 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:48:31,027 INFO  L93              Difference]: Finished difference Result 22 states and 21 transitions.
[2023-11-19 07:48:31,028 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-19 07:48:31,028 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16
[2023-11-19 07:48:31,028 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:48:31,028 INFO  L225             Difference]: With dead ends: 22
[2023-11-19 07:48:31,029 INFO  L226             Difference]: Without dead ends: 22
[2023-11-19 07:48:31,029 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:48:31,030 INFO  L413           NwaCegarLoop]: 13 mSDtfsCounter, 5 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:48:31,030 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 15 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:48:31,031 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22 states.
[2023-11-19 07:48:31,032 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22.
[2023-11-19 07:48:31,032 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:31,032 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions.
[2023-11-19 07:48:31,033 INFO  L78                 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 16
[2023-11-19 07:48:31,033 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:48:31,033 INFO  L495      AbstractCegarLoop]: Abstraction has 22 states and 21 transitions.
[2023-11-19 07:48:31,033 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:31,034 INFO  L276                IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions.
[2023-11-19 07:48:31,034 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2023-11-19 07:48:31,034 INFO  L187           NwaCegarLoop]: Found error trace
[2023-11-19 07:48:31,034 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:48:31,035 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-11-19 07:48:31,035 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] ===
[2023-11-19 07:48:31,035 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:48:31,035 INFO  L85        PathProgramCache]: Analyzing trace with hash -1270184509, now seen corresponding path program 1 times
[2023-11-19 07:48:31,036 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:48:31,036 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108927241]
[2023-11-19 07:48:31,036 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:48:31,036 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:48:31,052 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:48:31,124 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:48:31,124 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:48:31,124 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108927241]
[2023-11-19 07:48:31,124 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108927241] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:48:31,125 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:48:31,125 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:48:31,125 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793819520]
[2023-11-19 07:48:31,125 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:48:31,126 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:48:31,126 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:48:31,126 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:48:31,126 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:48:31,127 INFO  L87              Difference]: Start difference. First operand 22 states and 21 transitions. Second operand  has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:31,145 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:48:31,145 INFO  L93              Difference]: Finished difference Result 21 states and 20 transitions.
[2023-11-19 07:48:31,146 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-19 07:48:31,146 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18
[2023-11-19 07:48:31,146 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:48:31,146 INFO  L225             Difference]: With dead ends: 21
[2023-11-19 07:48:31,147 INFO  L226             Difference]: Without dead ends: 20
[2023-11-19 07:48:31,147 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:48:31,148 INFO  L413           NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:48:31,148 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 24 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:48:31,149 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20 states.
[2023-11-19 07:48:31,149 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20.
[2023-11-19 07:48:31,150 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20 states, 19 states have (on average 1.0) internal successors, (19), 19 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:31,150 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions.
[2023-11-19 07:48:31,150 INFO  L78                 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 18
[2023-11-19 07:48:31,150 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:48:31,151 INFO  L495      AbstractCegarLoop]: Abstraction has 20 states and 19 transitions.
[2023-11-19 07:48:31,151 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:31,151 INFO  L276                IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions.
[2023-11-19 07:48:31,151 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2023-11-19 07:48:31,152 INFO  L187           NwaCegarLoop]: Found error trace
[2023-11-19 07:48:31,152 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:48:31,152 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2023-11-19 07:48:31,152 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] ===
[2023-11-19 07:48:31,153 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:48:31,153 INFO  L85        PathProgramCache]: Analyzing trace with hash -721016172, now seen corresponding path program 1 times
[2023-11-19 07:48:31,153 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:48:31,153 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692339401]
[2023-11-19 07:48:31,153 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:48:31,154 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:48:31,166 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:48:31,251 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:48:31,251 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:48:31,251 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692339401]
[2023-11-19 07:48:31,251 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692339401] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:48:31,252 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:48:31,252 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-19 07:48:31,252 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886877066]
[2023-11-19 07:48:31,252 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:48:31,253 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 07:48:31,253 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:48:31,253 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 07:48:31,254 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:48:31,254 INFO  L87              Difference]: Start difference. First operand 20 states and 19 transitions. Second operand  has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:31,300 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:48:31,301 INFO  L93              Difference]: Finished difference Result 17 states and 16 transitions.
[2023-11-19 07:48:31,301 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-11-19 07:48:31,301 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19
[2023-11-19 07:48:31,301 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:48:31,302 INFO  L225             Difference]: With dead ends: 17
[2023-11-19 07:48:31,302 INFO  L226             Difference]: Without dead ends: 0
[2023-11-19 07:48:31,302 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2023-11-19 07:48:31,303 INFO  L413           NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:48:31,304 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 33 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:48:31,304 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2023-11-19 07:48:31,305 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2023-11-19 07:48:31,305 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:31,305 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2023-11-19 07:48:31,305 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19
[2023-11-19 07:48:31,306 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:48:31,306 INFO  L495      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2023-11-19 07:48:31,306 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:48:31,306 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2023-11-19 07:48:31,306 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2023-11-19 07:48:31,309 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 14 remaining)
[2023-11-19 07:48:31,310 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining)
[2023-11-19 07:48:31,310 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining)
[2023-11-19 07:48:31,310 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining)
[2023-11-19 07:48:31,311 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining)
[2023-11-19 07:48:31,311 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining)
[2023-11-19 07:48:31,311 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining)
[2023-11-19 07:48:31,311 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining)
[2023-11-19 07:48:31,312 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining)
[2023-11-19 07:48:31,324 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining)
[2023-11-19 07:48:31,325 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining)
[2023-11-19 07:48:31,325 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining)
[2023-11-19 07:48:31,325 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (1 of 14 remaining)
[2023-11-19 07:48:31,326 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (0 of 14 remaining)
[2023-11-19 07:48:31,326 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2023-11-19 07:48:31,331 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:48:31,334 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-11-19 07:48:31,340 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:48:31 BoogieIcfgContainer
[2023-11-19 07:48:31,340 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-19 07:48:31,341 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-19 07:48:31,341 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2023-11-19 07:48:31,341 INFO  L274        PluginConnector]: Witness Printer initialized
[2023-11-19 07:48:31,342 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:48:27" (3/4) ...
[2023-11-19 07:48:31,344 INFO  L137         WitnessPrinter]: Generating witness for correct program
[2023-11-19 07:48:31,357 INFO  L943   BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges
[2023-11-19 07:48:31,357 INFO  L943   BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges
[2023-11-19 07:48:31,358 INFO  L943   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2023-11-19 07:48:31,358 INFO  L943   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2023-11-19 07:48:31,477 INFO  L149         WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da0f4e-a09e-4f45-83ad-674e7c8c067c/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml
[2023-11-19 07:48:31,480 INFO  L149         WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da0f4e-a09e-4f45-83ad-674e7c8c067c/bin/uautomizer-verify-uCwYo4JHxu/witness.yml
[2023-11-19 07:48:31,480 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-19 07:48:31,481 INFO  L158              Benchmark]: Toolchain (without parser) took 4921.77ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 112.8MB in the beginning and 149.3MB in the end (delta: -36.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2023-11-19 07:48:31,482 INFO  L158              Benchmark]: CDTParser took 0.23ms. Allocated memory is still 109.1MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-19 07:48:31,482 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 277.43ms. Allocated memory is still 153.1MB. Free memory was 112.8MB in the beginning and 122.6MB in the end (delta: -9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2023-11-19 07:48:31,482 INFO  L158              Benchmark]: Boogie Procedure Inliner took 35.15ms. Allocated memory is still 153.1MB. Free memory was 122.6MB in the beginning and 120.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-19 07:48:31,483 INFO  L158              Benchmark]: Boogie Preprocessor took 26.08ms. Allocated memory is still 153.1MB. Free memory was 120.5MB in the beginning and 119.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-19 07:48:31,483 INFO  L158              Benchmark]: RCFGBuilder took 410.81ms. Allocated memory is still 153.1MB. Free memory was 119.1MB in the beginning and 105.8MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2023-11-19 07:48:31,483 INFO  L158              Benchmark]: TraceAbstraction took 4025.62ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 105.1MB in the beginning and 154.5MB in the end (delta: -49.4MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB.
[2023-11-19 07:48:31,484 INFO  L158              Benchmark]: Witness Printer took 139.54ms. Allocated memory is still 184.5MB. Free memory was 154.5MB in the beginning and 149.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2023-11-19 07:48:31,489 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.23ms. Allocated memory is still 109.1MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 277.43ms. Allocated memory is still 153.1MB. Free memory was 112.8MB in the beginning and 122.6MB in the end (delta: -9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 35.15ms. Allocated memory is still 153.1MB. Free memory was 122.6MB in the beginning and 120.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 26.08ms. Allocated memory is still 153.1MB. Free memory was 120.5MB in the beginning and 119.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 410.81ms. Allocated memory is still 153.1MB. Free memory was 119.1MB in the beginning and 105.8MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
 * TraceAbstraction took 4025.62ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 105.1MB in the beginning and 154.5MB in the end (delta: -49.4MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB.
 * Witness Printer took 139.54ms. Allocated memory is still 184.5MB. Free memory was 154.5MB in the beginning and 149.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: -1]: pointer dereference always succeeds
    For all program executions holds that pointer dereference always succeeds at this location
  - PositiveResult [Line: -1]: pointer dereference always succeeds
    For all program executions holds that pointer dereference always succeeds at this location
  - PositiveResult [Line: -1]: pointer dereference always succeeds
    For all program executions holds that pointer dereference always succeeds at this location
  - PositiveResult [Line: -1]: pointer dereference always succeeds
    For all program executions holds that pointer dereference always succeeds at this location
  - PositiveResult [Line: -1]: pointer dereference always succeeds
    For all program executions holds that pointer dereference always succeeds at this location
  - PositiveResult [Line: -1]: pointer dereference always succeeds
    For all program executions holds that pointer dereference always succeeds at this location
  - PositiveResult [Line: -1]: pointer dereference always succeeds
    For all program executions holds that pointer dereference always succeeds at this location
  - PositiveResult [Line: -1]: pointer dereference always succeeds
    For all program executions holds that pointer dereference always succeeds at this location
  - PositiveResult [Line: -1]: pointer dereference always succeeds
    For all program executions holds that pointer dereference always succeeds at this location
  - PositiveResult [Line: -1]: pointer dereference always succeeds
    For all program executions holds that pointer dereference always succeeds at this location
  - PositiveResult [Line: -1]: pointer dereference always succeeds
    For all program executions holds that pointer dereference always succeeds at this location
  - PositiveResult [Line: -1]: pointer dereference always succeeds
    For all program executions holds that pointer dereference always succeeds at this location
  - PositiveResult [Line: 3]: all allocated memory was freed
    For all program executions holds that all allocated memory was freed at this location
  - PositiveResult [Line: 14]: all allocated memory was freed
    For all program executions holds that all allocated memory was freed at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 37 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 569 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 569 mSDsluCounter, 524 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 192 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 341 IncrementalHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 332 mSDtfsCounter, 341 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 26 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 1164 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    14 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2023-11-19 07:48:31,536 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00da0f4e-a09e-4f45-83ad-674e7c8c067c/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE