./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-middle-data.i --full-output --architecture 64bit


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


Checking for memory safety (deref-memtrack)
Using default analysis
Version 803cd42f
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/sll-middle-data.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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 64bit --witnessprinter.graph.data.programhash 1f089d84611e193726b0906f7c8f41bdfbd2779029235be3e70f3cbcf8b5071e
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m
[2024-11-22 18:52:29,602 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-22 18:52:29,690 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf
[2024-11-22 18:52:29,694 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-22 18:52:29,696 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-22 18:52:29,727 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-22 18:52:29,728 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-22 18:52:29,729 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-22 18:52:29,729 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-22 18:52:29,730 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-22 18:52:29,731 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-22 18:52:29,731 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-22 18:52:29,732 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-22 18:52:29,732 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-22 18:52:29,733 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-22 18:52:29,734 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-22 18:52:29,735 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-22 18:52:29,735 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-22 18:52:29,735 INFO  L153        SettingsManager]:  * Check for the main procedure if all allocated memory was freed=true
[2024-11-22 18:52:29,736 INFO  L153        SettingsManager]:  * Bitprecise bitfields=true
[2024-11-22 18:52:29,736 INFO  L153        SettingsManager]:  * SV-COMP memtrack compatibility mode=true
[2024-11-22 18:52:29,740 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-22 18:52:29,740 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-22 18:52:29,740 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-22 18:52:29,740 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-11-22 18:52:29,741 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-22 18:52:29,741 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-22 18:52:29,741 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-22 18:52:29,741 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-22 18:52:29,742 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-22 18:52:29,742 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-22 18:52:29,742 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-22 18:52:29,742 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-22 18:52:29,742 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-22 18:52:29,743 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-22 18:52:29,743 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-22 18:52:29,743 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-22 18:52:29,743 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-22 18:52:29,744 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-22 18:52:29,745 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 64bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1f089d84611e193726b0906f7c8f41bdfbd2779029235be3e70f3cbcf8b5071e
[2024-11-22 18:52:29,987 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-22 18:52:30,013 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-22 18:52:30,016 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-22 18:52:30,018 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-22 18:52:30,018 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-22 18:52:30,020 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-middle-data.i
[2024-11-22 18:52:31,477 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-22 18:52:31,802 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-22 18:52:31,802 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-middle-data.i
[2024-11-22 18:52:31,837 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9cb642a6/165149be17104abfb3fda117fb288951/FLAGf0b8d71ee
[2024-11-22 18:52:32,072 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9cb642a6/165149be17104abfb3fda117fb288951
[2024-11-22 18:52:32,074 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-22 18:52:32,075 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-22 18:52:32,077 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-22 18:52:32,077 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-22 18:52:32,084 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-22 18:52:32,085 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:52:32" (1/1) ...
[2024-11-22 18:52:32,086 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c4fcd97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32, skipping insertion in model container
[2024-11-22 18:52:32,086 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:52:32" (1/1) ...
[2024-11-22 18:52:32,146 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-22 18:52:32,502 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-22 18:52:32,512 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-22 18:52:32,556 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-22 18:52:32,592 INFO  L204         MainTranslator]: Completed translation
[2024-11-22 18:52:32,593 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32 WrapperNode
[2024-11-22 18:52:32,593 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-22 18:52:32,594 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-22 18:52:32,595 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-22 18:52:32,595 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-22 18:52:32,602 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32" (1/1) ...
[2024-11-22 18:52:32,623 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32" (1/1) ...
[2024-11-22 18:52:32,649 INFO  L138                Inliner]: procedures = 121, calls = 21, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 76
[2024-11-22 18:52:32,649 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-22 18:52:32,650 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-22 18:52:32,650 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-22 18:52:32,651 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-22 18:52:32,661 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32" (1/1) ...
[2024-11-22 18:52:32,662 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32" (1/1) ...
[2024-11-22 18:52:32,667 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32" (1/1) ...
[2024-11-22 18:52:32,685 INFO  L175           MemorySlicer]: Split 11 memory accesses to 1 slices as follows [11]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 6 writes are split as follows [6].
[2024-11-22 18:52:32,685 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32" (1/1) ...
[2024-11-22 18:52:32,685 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32" (1/1) ...
[2024-11-22 18:52:32,701 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32" (1/1) ...
[2024-11-22 18:52:32,704 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32" (1/1) ...
[2024-11-22 18:52:32,710 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32" (1/1) ...
[2024-11-22 18:52:32,711 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32" (1/1) ...
[2024-11-22 18:52:32,713 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-22 18:52:32,714 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-22 18:52:32,715 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-22 18:52:32,715 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-22 18:52:32,716 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32" (1/1) ...
[2024-11-22 18:52:32,726 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-22 18:52:32,735 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-22 18:52:32,750 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-22 18:52:32,752 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-22 18:52:32,794 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2024-11-22 18:52:32,794 INFO  L130     BoogieDeclarations]: Found specification of procedure alloc_and_zero
[2024-11-22 18:52:32,794 INFO  L138     BoogieDeclarations]: Found implementation of procedure alloc_and_zero
[2024-11-22 18:52:32,794 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-11-22 18:52:32,795 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#0
[2024-11-22 18:52:32,795 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#0
[2024-11-22 18:52:32,795 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-11-22 18:52:32,795 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-22 18:52:32,795 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-22 18:52:32,899 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-22 18:52:32,900 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-22 18:52:33,144 INFO  L?                        ?]: Removed 79 outVars from TransFormulas that were not future-live.
[2024-11-22 18:52:33,145 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-22 18:52:33,161 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-22 18:52:33,162 INFO  L316             CfgBuilder]: Removed 3 assume(true) statements.
[2024-11-22 18:52:33,162 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:52:33 BoogieIcfgContainer
[2024-11-22 18:52:33,163 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-22 18:52:33,165 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-22 18:52:33,166 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-22 18:52:33,170 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-22 18:52:33,170 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:52:32" (1/3) ...
[2024-11-22 18:52:33,171 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d050ce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:52:33, skipping insertion in model container
[2024-11-22 18:52:33,171 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:32" (2/3) ...
[2024-11-22 18:52:33,172 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d050ce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:52:33, skipping insertion in model container
[2024-11-22 18:52:33,173 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:52:33" (3/3) ...
[2024-11-22 18:52:33,175 INFO  L112   eAbstractionObserver]: Analyzing ICFG sll-middle-data.i
[2024-11-22 18:52:33,188 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-22 18:52:33,188 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations.
[2024-11-22 18:52:33,235 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-22 18:52:33,245 INFO  L333      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@21279bae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-22 18:52:33,246 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 26 error locations.
[2024-11-22 18:52:33,255 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 71 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 67 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-22 18:52:33,262 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2024-11-22 18:52:33,264 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:33,264 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2024-11-22 18:52:33,265 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:33,273 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:33,273 INFO  L85        PathProgramCache]: Analyzing trace with hash 34510473, now seen corresponding path program 1 times
[2024-11-22 18:52:33,303 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:33,303 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603457876]
[2024-11-22 18:52:33,303 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:33,304 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:33,427 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:33,573 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 18:52:33,576 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:33,576 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603457876]
[2024-11-22 18:52:33,577 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603457876] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 18:52:33,578 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 18:52:33,578 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-22 18:52:33,579 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001160364]
[2024-11-22 18:52:33,580 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 18:52:33,585 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-22 18:52:33,585 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:33,614 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-22 18:52:33,615 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-22 18:52:33,618 INFO  L87              Difference]: Start difference. First operand  has 71 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 67 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand  has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-22 18:52:33,699 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:33,700 INFO  L93              Difference]: Finished difference Result 70 states and 73 transitions.
[2024-11-22 18:52:33,701 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-22 18:52:33,702 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5
[2024-11-22 18:52:33,703 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:33,710 INFO  L225             Difference]: With dead ends: 70
[2024-11-22 18:52:33,710 INFO  L226             Difference]: Without dead ends: 68
[2024-11-22 18:52:33,712 INFO  L431           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
[2024-11-22 18:52:33,715 INFO  L432           NwaCegarLoop]: 70 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:33,717 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-22 18:52:33,733 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 68 states.
[2024-11-22 18:52:33,752 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68.
[2024-11-22 18:52:33,754 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 68 states, 40 states have (on average 1.675) internal successors, (67), 64 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-22 18:52:33,755 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions.
[2024-11-22 18:52:33,757 INFO  L78                 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 5
[2024-11-22 18:52:33,757 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:33,757 INFO  L471      AbstractCegarLoop]: Abstraction has 68 states and 71 transitions.
[2024-11-22 18:52:33,757 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-22 18:52:33,758 INFO  L276                IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions.
[2024-11-22 18:52:33,758 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2024-11-22 18:52:33,758 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:33,759 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2024-11-22 18:52:33,759 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-22 18:52:33,759 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:33,760 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:33,761 INFO  L85        PathProgramCache]: Analyzing trace with hash 34510474, now seen corresponding path program 1 times
[2024-11-22 18:52:33,761 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:33,761 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929191847]
[2024-11-22 18:52:33,761 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:33,761 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:33,781 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:33,864 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 18:52:33,864 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:33,865 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929191847]
[2024-11-22 18:52:33,865 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929191847] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 18:52:33,865 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 18:52:33,865 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-22 18:52:33,865 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089812584]
[2024-11-22 18:52:33,866 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 18:52:33,867 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-22 18:52:33,867 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:33,867 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-22 18:52:33,868 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-22 18:52:33,868 INFO  L87              Difference]: Start difference. First operand 68 states and 71 transitions. Second operand  has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-22 18:52:33,921 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:33,921 INFO  L93              Difference]: Finished difference Result 67 states and 70 transitions.
[2024-11-22 18:52:33,922 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-22 18:52:33,922 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5
[2024-11-22 18:52:33,922 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:33,923 INFO  L225             Difference]: With dead ends: 67
[2024-11-22 18:52:33,923 INFO  L226             Difference]: Without dead ends: 67
[2024-11-22 18:52:33,923 INFO  L431           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
[2024-11-22 18:52:33,924 INFO  L432           NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:33,925 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 115 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-22 18:52:33,927 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 67 states.
[2024-11-22 18:52:33,932 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67.
[2024-11-22 18:52:33,933 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 67 states, 40 states have (on average 1.65) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-22 18:52:33,934 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions.
[2024-11-22 18:52:33,935 INFO  L78                 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 5
[2024-11-22 18:52:33,936 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:33,936 INFO  L471      AbstractCegarLoop]: Abstraction has 67 states and 70 transitions.
[2024-11-22 18:52:33,936 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-22 18:52:33,937 INFO  L276                IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions.
[2024-11-22 18:52:33,937 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2024-11-22 18:52:33,937 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:33,938 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:33,938 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-22 18:52:33,939 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:33,940 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:33,940 INFO  L85        PathProgramCache]: Analyzing trace with hash -168921788, now seen corresponding path program 1 times
[2024-11-22 18:52:33,940 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:33,940 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891103897]
[2024-11-22 18:52:33,941 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:33,941 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:33,964 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:34,093 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 18:52:34,093 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:34,095 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891103897]
[2024-11-22 18:52:34,095 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891103897] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 18:52:34,095 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 18:52:34,095 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-22 18:52:34,095 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988463059]
[2024-11-22 18:52:34,095 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 18:52:34,096 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-22 18:52:34,096 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:34,098 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-22 18:52:34,098 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-22 18:52:34,098 INFO  L87              Difference]: Start difference. First operand 67 states and 70 transitions. Second operand  has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-22 18:52:34,234 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:34,234 INFO  L93              Difference]: Finished difference Result 67 states and 72 transitions.
[2024-11-22 18:52:34,235 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-22 18:52:34,235 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10
[2024-11-22 18:52:34,236 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:34,237 INFO  L225             Difference]: With dead ends: 67
[2024-11-22 18:52:34,238 INFO  L226             Difference]: Without dead ends: 67
[2024-11-22 18:52:34,238 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-22 18:52:34,239 INFO  L432           NwaCegarLoop]: 48 mSDtfsCounter, 21 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:34,240 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 166 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-22 18:52:34,241 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 67 states.
[2024-11-22 18:52:34,245 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62.
[2024-11-22 18:52:34,246 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 62 states, 40 states have (on average 1.525) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-22 18:52:34,247 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions.
[2024-11-22 18:52:34,247 INFO  L78                 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 10
[2024-11-22 18:52:34,247 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:34,248 INFO  L471      AbstractCegarLoop]: Abstraction has 62 states and 65 transitions.
[2024-11-22 18:52:34,248 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-22 18:52:34,248 INFO  L276                IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions.
[2024-11-22 18:52:34,248 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2024-11-22 18:52:34,248 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:34,249 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:34,249 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-22 18:52:34,249 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:34,250 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:34,250 INFO  L85        PathProgramCache]: Analyzing trace with hash -168921787, now seen corresponding path program 1 times
[2024-11-22 18:52:34,250 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:34,250 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880815691]
[2024-11-22 18:52:34,250 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:34,251 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:34,262 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:34,469 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 18:52:34,469 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:34,470 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880815691]
[2024-11-22 18:52:34,470 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880815691] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 18:52:34,470 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 18:52:34,471 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-22 18:52:34,471 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646567165]
[2024-11-22 18:52:34,471 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 18:52:34,472 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-22 18:52:34,472 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:34,473 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-22 18:52:34,474 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-22 18:52:34,474 INFO  L87              Difference]: Start difference. First operand 62 states and 65 transitions. Second operand  has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-22 18:52:34,587 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:34,588 INFO  L93              Difference]: Finished difference Result 66 states and 71 transitions.
[2024-11-22 18:52:34,590 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-22 18:52:34,591 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10
[2024-11-22 18:52:34,591 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:34,592 INFO  L225             Difference]: With dead ends: 66
[2024-11-22 18:52:34,592 INFO  L226             Difference]: Without dead ends: 66
[2024-11-22 18:52:34,592 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-22 18:52:34,593 INFO  L432           NwaCegarLoop]: 58 mSDtfsCounter, 8 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:34,593 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 220 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-22 18:52:34,596 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 66 states.
[2024-11-22 18:52:34,601 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61.
[2024-11-22 18:52:34,602 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 61 states, 40 states have (on average 1.5) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-22 18:52:34,603 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions.
[2024-11-22 18:52:34,604 INFO  L78                 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 10
[2024-11-22 18:52:34,604 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:34,604 INFO  L471      AbstractCegarLoop]: Abstraction has 61 states and 64 transitions.
[2024-11-22 18:52:34,604 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-22 18:52:34,605 INFO  L276                IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions.
[2024-11-22 18:52:34,605 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2024-11-22 18:52:34,605 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:34,605 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:34,605 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-22 18:52:34,606 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:34,607 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:34,607 INFO  L85        PathProgramCache]: Analyzing trace with hash 874918470, now seen corresponding path program 1 times
[2024-11-22 18:52:34,607 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:34,607 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260235857]
[2024-11-22 18:52:34,608 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:34,608 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:34,624 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:34,820 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 18:52:34,821 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:34,822 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260235857]
[2024-11-22 18:52:34,822 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260235857] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 18:52:34,822 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 18:52:34,822 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-22 18:52:34,824 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386855671]
[2024-11-22 18:52:34,824 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 18:52:34,824 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-22 18:52:34,824 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:34,825 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-22 18:52:34,825 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-22 18:52:34,826 INFO  L87              Difference]: Start difference. First operand 61 states and 64 transitions. Second operand  has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-22 18:52:34,933 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:34,933 INFO  L93              Difference]: Finished difference Result 65 states and 70 transitions.
[2024-11-22 18:52:34,936 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-22 18:52:34,936 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12
[2024-11-22 18:52:34,937 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:34,937 INFO  L225             Difference]: With dead ends: 65
[2024-11-22 18:52:34,937 INFO  L226             Difference]: Without dead ends: 65
[2024-11-22 18:52:34,938 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-22 18:52:34,939 INFO  L432           NwaCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:34,941 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 201 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-22 18:52:34,945 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 65 states.
[2024-11-22 18:52:34,954 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60.
[2024-11-22 18:52:34,955 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 60 states, 40 states have (on average 1.475) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-22 18:52:34,956 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions.
[2024-11-22 18:52:34,956 INFO  L78                 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 12
[2024-11-22 18:52:34,956 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:34,956 INFO  L471      AbstractCegarLoop]: Abstraction has 60 states and 63 transitions.
[2024-11-22 18:52:34,956 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-22 18:52:34,957 INFO  L276                IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions.
[2024-11-22 18:52:34,959 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2024-11-22 18:52:34,959 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:34,960 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:34,960 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-22 18:52:34,960 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:34,961 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:34,961 INFO  L85        PathProgramCache]: Analyzing trace with hash -1406976365, now seen corresponding path program 1 times
[2024-11-22 18:52:34,962 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:34,962 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92172790]
[2024-11-22 18:52:34,962 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:34,962 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:34,993 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:35,124 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 18:52:35,125 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:35,125 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92172790]
[2024-11-22 18:52:35,125 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92172790] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 18:52:35,125 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 18:52:35,125 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-22 18:52:35,126 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956234281]
[2024-11-22 18:52:35,127 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 18:52:35,127 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-22 18:52:35,127 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:35,128 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-22 18:52:35,129 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2024-11-22 18:52:35,129 INFO  L87              Difference]: Start difference. First operand 60 states and 63 transitions. Second operand  has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-22 18:52:35,280 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:35,280 INFO  L93              Difference]: Finished difference Result 68 states and 75 transitions.
[2024-11-22 18:52:35,281 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-22 18:52:35,281 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20
[2024-11-22 18:52:35,282 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:35,283 INFO  L225             Difference]: With dead ends: 68
[2024-11-22 18:52:35,285 INFO  L226             Difference]: Without dead ends: 68
[2024-11-22 18:52:35,286 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2024-11-22 18:52:35,286 INFO  L432           NwaCegarLoop]: 52 mSDtfsCounter, 1 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:35,287 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 233 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-22 18:52:35,287 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 68 states.
[2024-11-22 18:52:35,291 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67.
[2024-11-22 18:52:35,291 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 67 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 63 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-22 18:52:35,295 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions.
[2024-11-22 18:52:35,296 INFO  L78                 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 20
[2024-11-22 18:52:35,296 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:35,296 INFO  L471      AbstractCegarLoop]: Abstraction has 67 states and 73 transitions.
[2024-11-22 18:52:35,296 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-22 18:52:35,296 INFO  L276                IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions.
[2024-11-22 18:52:35,297 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2024-11-22 18:52:35,297 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:35,297 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:35,297 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-22 18:52:35,297 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:35,298 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:35,298 INFO  L85        PathProgramCache]: Analyzing trace with hash -1406976364, now seen corresponding path program 1 times
[2024-11-22 18:52:35,298 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:35,298 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618950505]
[2024-11-22 18:52:35,298 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:35,299 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:35,322 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:35,564 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 18:52:35,564 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:35,564 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618950505]
[2024-11-22 18:52:35,565 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618950505] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 18:52:35,567 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 18:52:35,567 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-22 18:52:35,567 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401421052]
[2024-11-22 18:52:35,567 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 18:52:35,568 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-22 18:52:35,568 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:35,568 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-22 18:52:35,568 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2024-11-22 18:52:35,569 INFO  L87              Difference]: Start difference. First operand 67 states and 73 transitions. Second operand  has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-22 18:52:35,709 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:35,709 INFO  L93              Difference]: Finished difference Result 68 states and 74 transitions.
[2024-11-22 18:52:35,710 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-22 18:52:35,710 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20
[2024-11-22 18:52:35,710 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:35,711 INFO  L225             Difference]: With dead ends: 68
[2024-11-22 18:52:35,712 INFO  L226             Difference]: Without dead ends: 68
[2024-11-22 18:52:35,712 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2024-11-22 18:52:35,713 INFO  L432           NwaCegarLoop]: 53 mSDtfsCounter, 1 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:35,714 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 248 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-22 18:52:35,716 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 68 states.
[2024-11-22 18:52:35,718 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67.
[2024-11-22 18:52:35,721 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 67 states, 47 states have (on average 1.446808510638298) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-22 18:52:35,722 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions.
[2024-11-22 18:52:35,724 INFO  L78                 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 20
[2024-11-22 18:52:35,725 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:35,725 INFO  L471      AbstractCegarLoop]: Abstraction has 67 states and 72 transitions.
[2024-11-22 18:52:35,725 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-22 18:52:35,725 INFO  L276                IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions.
[2024-11-22 18:52:35,726 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2024-11-22 18:52:35,726 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:35,726 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:35,726 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-22 18:52:35,726 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:35,727 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:35,727 INFO  L85        PathProgramCache]: Analyzing trace with hash -666645695, now seen corresponding path program 1 times
[2024-11-22 18:52:35,728 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:35,728 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377288125]
[2024-11-22 18:52:35,728 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:35,728 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:35,741 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:35,805 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 18:52:35,805 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:35,806 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377288125]
[2024-11-22 18:52:35,806 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377288125] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 18:52:35,806 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 18:52:35,806 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-22 18:52:35,806 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974636507]
[2024-11-22 18:52:35,806 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 18:52:35,807 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-22 18:52:35,807 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:35,808 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-22 18:52:35,808 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2024-11-22 18:52:35,808 INFO  L87              Difference]: Start difference. First operand 67 states and 72 transitions. Second operand  has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-22 18:52:35,850 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:35,850 INFO  L93              Difference]: Finished difference Result 70 states and 76 transitions.
[2024-11-22 18:52:35,851 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-22 18:52:35,851 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21
[2024-11-22 18:52:35,851 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:35,852 INFO  L225             Difference]: With dead ends: 70
[2024-11-22 18:52:35,852 INFO  L226             Difference]: Without dead ends: 70
[2024-11-22 18:52:35,852 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2024-11-22 18:52:35,853 INFO  L432           NwaCegarLoop]: 56 mSDtfsCounter, 24 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:35,853 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 352 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-22 18:52:35,854 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 70 states.
[2024-11-22 18:52:35,856 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68.
[2024-11-22 18:52:35,857 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 68 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-22 18:52:35,857 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions.
[2024-11-22 18:52:35,857 INFO  L78                 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 21
[2024-11-22 18:52:35,857 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:35,857 INFO  L471      AbstractCegarLoop]: Abstraction has 68 states and 72 transitions.
[2024-11-22 18:52:35,858 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-22 18:52:35,858 INFO  L276                IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions.
[2024-11-22 18:52:35,858 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2024-11-22 18:52:35,858 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:35,858 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:35,858 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-22 18:52:35,858 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:35,859 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:35,859 INFO  L85        PathProgramCache]: Analyzing trace with hash 561056622, now seen corresponding path program 1 times
[2024-11-22 18:52:35,862 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:35,863 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016127899]
[2024-11-22 18:52:35,863 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:35,863 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:35,887 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:36,182 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 18:52:36,182 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:36,182 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016127899]
[2024-11-22 18:52:36,182 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016127899] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-22 18:52:36,183 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385399402]
[2024-11-22 18:52:36,183 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:36,183 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-22 18:52:36,183 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-22 18:52:36,186 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-22 18:52:36,187 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-22 18:52:36,267 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:36,269 INFO  L255         TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-22 18:52:36,275 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 18:52:36,440 WARN  L873   $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true
[2024-11-22 18:52:36,500 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-11-22 18:52:36,510 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-11-22 18:52:36,524 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-11-22 18:52:36,525 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-11-22 18:52:36,547 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 18:52:36,550 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-22 18:52:36,550 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [385399402] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 18:52:36,551 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-22 18:52:36,551 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14
[2024-11-22 18:52:36,551 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995084311]
[2024-11-22 18:52:36,551 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 18:52:36,551 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-22 18:52:36,551 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:36,552 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-22 18:52:36,552 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=148, Unknown=1, NotChecked=24, Total=210
[2024-11-22 18:52:36,552 INFO  L87              Difference]: Start difference. First operand 68 states and 72 transitions. Second operand  has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-22 18:52:36,655 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:36,656 INFO  L93              Difference]: Finished difference Result 84 states and 90 transitions.
[2024-11-22 18:52:36,656 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-22 18:52:36,657 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22
[2024-11-22 18:52:36,657 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:36,657 INFO  L225             Difference]: With dead ends: 84
[2024-11-22 18:52:36,658 INFO  L226             Difference]: Without dead ends: 84
[2024-11-22 18:52:36,658 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=148, Unknown=1, NotChecked=24, Total=210
[2024-11-22 18:52:36,659 INFO  L432           NwaCegarLoop]: 49 mSDtfsCounter, 46 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:36,659 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 137 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 103 Unchecked, 0.1s Time]
[2024-11-22 18:52:36,659 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2024-11-22 18:52:36,665 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80.
[2024-11-22 18:52:36,665 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 80 states, 59 states have (on average 1.423728813559322) internal successors, (84), 75 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-22 18:52:36,667 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions.
[2024-11-22 18:52:36,667 INFO  L78                 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 22
[2024-11-22 18:52:36,667 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:36,667 INFO  L471      AbstractCegarLoop]: Abstraction has 80 states and 90 transitions.
[2024-11-22 18:52:36,668 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-22 18:52:36,668 INFO  L276                IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions.
[2024-11-22 18:52:36,668 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2024-11-22 18:52:36,668 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:36,668 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:36,679 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-22 18:52:36,869 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-22 18:52:36,869 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:36,870 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:36,870 INFO  L85        PathProgramCache]: Analyzing trace with hash 561056621, now seen corresponding path program 1 times
[2024-11-22 18:52:36,870 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:36,870 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041679663]
[2024-11-22 18:52:36,870 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:36,870 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:36,890 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:37,031 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 18:52:37,032 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:37,032 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041679663]
[2024-11-22 18:52:37,032 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041679663] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 18:52:37,032 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 18:52:37,032 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-22 18:52:37,032 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674792089]
[2024-11-22 18:52:37,033 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 18:52:37,033 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-22 18:52:37,033 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:37,033 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-22 18:52:37,034 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-11-22 18:52:37,034 INFO  L87              Difference]: Start difference. First operand 80 states and 90 transitions. Second operand  has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-22 18:52:37,144 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:37,144 INFO  L93              Difference]: Finished difference Result 80 states and 89 transitions.
[2024-11-22 18:52:37,145 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-22 18:52:37,145 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22
[2024-11-22 18:52:37,145 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:37,146 INFO  L225             Difference]: With dead ends: 80
[2024-11-22 18:52:37,146 INFO  L226             Difference]: Without dead ends: 80
[2024-11-22 18:52:37,146 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-11-22 18:52:37,147 INFO  L432           NwaCegarLoop]: 47 mSDtfsCounter, 16 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:37,149 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 135 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-22 18:52:37,150 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 80 states.
[2024-11-22 18:52:37,155 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80.
[2024-11-22 18:52:37,156 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 80 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 75 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-22 18:52:37,159 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions.
[2024-11-22 18:52:37,160 INFO  L78                 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 22
[2024-11-22 18:52:37,160 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:37,160 INFO  L471      AbstractCegarLoop]: Abstraction has 80 states and 89 transitions.
[2024-11-22 18:52:37,160 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-22 18:52:37,160 INFO  L276                IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions.
[2024-11-22 18:52:37,161 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2024-11-22 18:52:37,161 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:37,161 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:37,162 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-22 18:52:37,162 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:37,163 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:37,163 INFO  L85        PathProgramCache]: Analyzing trace with hash 1417695502, now seen corresponding path program 1 times
[2024-11-22 18:52:37,163 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:37,164 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702539595]
[2024-11-22 18:52:37,164 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:37,164 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:37,187 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:37,691 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 18:52:37,691 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:37,691 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702539595]
[2024-11-22 18:52:37,692 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702539595] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-22 18:52:37,692 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727005422]
[2024-11-22 18:52:37,692 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:37,692 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-22 18:52:37,692 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-22 18:52:37,695 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-22 18:52:37,697 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-22 18:52:37,775 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:37,777 INFO  L255         TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 55 conjuncts are in the unsatisfiable core
[2024-11-22 18:52:37,780 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 18:52:37,792 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2024-11-22 18:52:37,798 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2024-11-22 18:52:37,933 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-11-22 18:52:37,947 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-11-22 18:52:37,976 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13
[2024-11-22 18:52:37,985 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13
[2024-11-22 18:52:38,110 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 18:52:38,110 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-22 18:52:38,426 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 18:52:38,430 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [727005422] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-22 18:52:38,431 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-22 18:52:38,431 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 21
[2024-11-22 18:52:38,431 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473437439]
[2024-11-22 18:52:38,431 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-22 18:52:38,431 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2024-11-22 18:52:38,431 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:38,432 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2024-11-22 18:52:38,432 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420
[2024-11-22 18:52:38,432 INFO  L87              Difference]: Start difference. First operand 80 states and 89 transitions. Second operand  has 21 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-22 18:52:38,649 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:38,650 INFO  L93              Difference]: Finished difference Result 82 states and 91 transitions.
[2024-11-22 18:52:38,650 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-11-22 18:52:38,650 INFO  L78                 Accepts]: Start accepts. Automaton has  has 21 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24
[2024-11-22 18:52:38,650 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:38,651 INFO  L225             Difference]: With dead ends: 82
[2024-11-22 18:52:38,651 INFO  L226             Difference]: Without dead ends: 82
[2024-11-22 18:52:38,651 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420
[2024-11-22 18:52:38,652 INFO  L432           NwaCegarLoop]: 52 mSDtfsCounter, 9 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:38,652 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 632 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-22 18:52:38,653 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 82 states.
[2024-11-22 18:52:38,655 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82.
[2024-11-22 18:52:38,656 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 82 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 77 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-22 18:52:38,660 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions.
[2024-11-22 18:52:38,661 INFO  L78                 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 24
[2024-11-22 18:52:38,661 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:38,661 INFO  L471      AbstractCegarLoop]: Abstraction has 82 states and 91 transitions.
[2024-11-22 18:52:38,662 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 21 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-22 18:52:38,662 INFO  L276                IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions.
[2024-11-22 18:52:38,662 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2024-11-22 18:52:38,663 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:38,663 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:38,673 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-11-22 18:52:38,864 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2024-11-22 18:52:38,864 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:38,865 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:38,865 INFO  L85        PathProgramCache]: Analyzing trace with hash 998836262, now seen corresponding path program 1 times
[2024-11-22 18:52:38,865 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:38,865 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141316768]
[2024-11-22 18:52:38,865 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:38,865 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:38,878 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:38,961 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-22 18:52:38,962 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:38,962 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141316768]
[2024-11-22 18:52:38,962 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141316768] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 18:52:38,962 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 18:52:38,962 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-22 18:52:38,962 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360793545]
[2024-11-22 18:52:38,963 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 18:52:38,963 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-22 18:52:38,963 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:38,963 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-22 18:52:38,964 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2024-11-22 18:52:38,964 INFO  L87              Difference]: Start difference. First operand 82 states and 91 transitions. Second operand  has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-22 18:52:39,104 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:39,104 INFO  L93              Difference]: Finished difference Result 84 states and 95 transitions.
[2024-11-22 18:52:39,104 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-11-22 18:52:39,105 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25
[2024-11-22 18:52:39,105 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:39,105 INFO  L225             Difference]: With dead ends: 84
[2024-11-22 18:52:39,105 INFO  L226             Difference]: Without dead ends: 84
[2024-11-22 18:52:39,105 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2024-11-22 18:52:39,106 INFO  L432           NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:39,106 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 235 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-22 18:52:39,107 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2024-11-22 18:52:39,109 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84.
[2024-11-22 18:52:39,109 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 84 states, 64 states have (on average 1.390625) internal successors, (89), 79 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-22 18:52:39,110 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions.
[2024-11-22 18:52:39,110 INFO  L78                 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 25
[2024-11-22 18:52:39,110 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:39,110 INFO  L471      AbstractCegarLoop]: Abstraction has 84 states and 95 transitions.
[2024-11-22 18:52:39,110 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-22 18:52:39,110 INFO  L276                IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions.
[2024-11-22 18:52:39,111 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2024-11-22 18:52:39,111 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:39,111 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:39,111 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-22 18:52:39,112 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:39,112 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:39,112 INFO  L85        PathProgramCache]: Analyzing trace with hash 998836263, now seen corresponding path program 1 times
[2024-11-22 18:52:39,112 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:39,112 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942548220]
[2024-11-22 18:52:39,113 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:39,113 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:39,124 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:39,289 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-22 18:52:39,290 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:39,290 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942548220]
[2024-11-22 18:52:39,290 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942548220] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 18:52:39,290 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 18:52:39,290 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-22 18:52:39,291 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015197386]
[2024-11-22 18:52:39,291 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 18:52:39,291 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-22 18:52:39,291 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:39,292 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-22 18:52:39,292 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2024-11-22 18:52:39,292 INFO  L87              Difference]: Start difference. First operand 84 states and 95 transitions. Second operand  has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-22 18:52:39,449 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:39,449 INFO  L93              Difference]: Finished difference Result 86 states and 96 transitions.
[2024-11-22 18:52:39,450 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-11-22 18:52:39,450 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25
[2024-11-22 18:52:39,450 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:39,451 INFO  L225             Difference]: With dead ends: 86
[2024-11-22 18:52:39,451 INFO  L226             Difference]: Without dead ends: 86
[2024-11-22 18:52:39,451 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2024-11-22 18:52:39,451 INFO  L432           NwaCegarLoop]: 49 mSDtfsCounter, 3 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:39,452 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 253 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-22 18:52:39,453 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 86 states.
[2024-11-22 18:52:39,458 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86.
[2024-11-22 18:52:39,459 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 86 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 81 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-22 18:52:39,459 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions.
[2024-11-22 18:52:39,459 INFO  L78                 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 25
[2024-11-22 18:52:39,459 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:39,459 INFO  L471      AbstractCegarLoop]: Abstraction has 86 states and 96 transitions.
[2024-11-22 18:52:39,460 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-22 18:52:39,460 INFO  L276                IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions.
[2024-11-22 18:52:39,460 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2024-11-22 18:52:39,460 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:39,460 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:39,460 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-11-22 18:52:39,461 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:39,461 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:39,461 INFO  L85        PathProgramCache]: Analyzing trace with hash -1577780753, now seen corresponding path program 1 times
[2024-11-22 18:52:39,465 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:39,465 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072868884]
[2024-11-22 18:52:39,465 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:39,466 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:39,482 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:39,568 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-22 18:52:39,569 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:39,569 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072868884]
[2024-11-22 18:52:39,569 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072868884] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 18:52:39,569 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 18:52:39,569 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-22 18:52:39,571 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226459835]
[2024-11-22 18:52:39,571 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 18:52:39,571 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-22 18:52:39,571 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:39,572 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-22 18:52:39,572 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-22 18:52:39,572 INFO  L87              Difference]: Start difference. First operand 86 states and 96 transitions. Second operand  has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-22 18:52:39,667 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:39,668 INFO  L93              Difference]: Finished difference Result 85 states and 94 transitions.
[2024-11-22 18:52:39,668 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-22 18:52:39,668 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26
[2024-11-22 18:52:39,669 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:39,669 INFO  L225             Difference]: With dead ends: 85
[2024-11-22 18:52:39,669 INFO  L226             Difference]: Without dead ends: 85
[2024-11-22 18:52:39,670 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-11-22 18:52:39,670 INFO  L432           NwaCegarLoop]: 53 mSDtfsCounter, 5 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:39,670 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 218 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-22 18:52:39,671 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 85 states.
[2024-11-22 18:52:39,673 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85.
[2024-11-22 18:52:39,673 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 85 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 80 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-22 18:52:39,674 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions.
[2024-11-22 18:52:39,674 INFO  L78                 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 26
[2024-11-22 18:52:39,674 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:39,675 INFO  L471      AbstractCegarLoop]: Abstraction has 85 states and 94 transitions.
[2024-11-22 18:52:39,675 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-22 18:52:39,675 INFO  L276                IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions.
[2024-11-22 18:52:39,676 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2024-11-22 18:52:39,677 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:39,677 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:39,677 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-11-22 18:52:39,677 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:39,677 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:39,677 INFO  L85        PathProgramCache]: Analyzing trace with hash -1577780752, now seen corresponding path program 1 times
[2024-11-22 18:52:39,678 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:39,678 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189269244]
[2024-11-22 18:52:39,678 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:39,678 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:39,694 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:39,869 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-22 18:52:39,869 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:39,869 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189269244]
[2024-11-22 18:52:39,870 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189269244] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 18:52:39,870 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 18:52:39,870 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-22 18:52:39,870 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690792964]
[2024-11-22 18:52:39,870 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 18:52:39,870 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-22 18:52:39,871 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:39,871 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-22 18:52:39,871 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-22 18:52:39,871 INFO  L87              Difference]: Start difference. First operand 85 states and 94 transitions. Second operand  has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-22 18:52:39,976 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:39,977 INFO  L93              Difference]: Finished difference Result 84 states and 92 transitions.
[2024-11-22 18:52:39,977 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-22 18:52:39,977 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26
[2024-11-22 18:52:39,978 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:39,978 INFO  L225             Difference]: With dead ends: 84
[2024-11-22 18:52:39,978 INFO  L226             Difference]: Without dead ends: 84
[2024-11-22 18:52:39,980 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-11-22 18:52:39,980 INFO  L432           NwaCegarLoop]: 53 mSDtfsCounter, 4 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:39,981 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 227 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-22 18:52:39,981 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2024-11-22 18:52:39,982 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84.
[2024-11-22 18:52:39,983 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 84 states, 66 states have (on average 1.303030303030303) internal successors, (86), 79 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-22 18:52:39,983 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions.
[2024-11-22 18:52:39,983 INFO  L78                 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 26
[2024-11-22 18:52:39,983 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:39,983 INFO  L471      AbstractCegarLoop]: Abstraction has 84 states and 92 transitions.
[2024-11-22 18:52:39,983 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-22 18:52:39,984 INFO  L276                IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions.
[2024-11-22 18:52:39,984 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2024-11-22 18:52:39,984 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:39,984 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:39,984 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-11-22 18:52:39,984 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:39,985 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:39,985 INFO  L85        PathProgramCache]: Analyzing trace with hash 899151603, now seen corresponding path program 1 times
[2024-11-22 18:52:39,985 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:39,985 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379309388]
[2024-11-22 18:52:39,985 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:39,987 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:40,001 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:40,129 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-22 18:52:40,129 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:40,129 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379309388]
[2024-11-22 18:52:40,129 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379309388] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 18:52:40,129 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 18:52:40,129 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-11-22 18:52:40,129 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663741375]
[2024-11-22 18:52:40,129 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 18:52:40,130 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-22 18:52:40,130 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:40,130 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-22 18:52:40,130 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2024-11-22 18:52:40,130 INFO  L87              Difference]: Start difference. First operand 84 states and 92 transitions. Second operand  has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-22 18:52:40,184 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:40,185 INFO  L93              Difference]: Finished difference Result 91 states and 101 transitions.
[2024-11-22 18:52:40,187 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-11-22 18:52:40,187 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26
[2024-11-22 18:52:40,187 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:40,188 INFO  L225             Difference]: With dead ends: 91
[2024-11-22 18:52:40,188 INFO  L226             Difference]: Without dead ends: 91
[2024-11-22 18:52:40,188 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2024-11-22 18:52:40,188 INFO  L432           NwaCegarLoop]: 50 mSDtfsCounter, 28 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:40,189 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 354 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-22 18:52:40,189 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 91 states.
[2024-11-22 18:52:40,191 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85.
[2024-11-22 18:52:40,191 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 85 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 80 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-22 18:52:40,191 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions.
[2024-11-22 18:52:40,191 INFO  L78                 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 26
[2024-11-22 18:52:40,192 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:40,192 INFO  L471      AbstractCegarLoop]: Abstraction has 85 states and 92 transitions.
[2024-11-22 18:52:40,192 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-22 18:52:40,192 INFO  L276                IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions.
[2024-11-22 18:52:40,193 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2024-11-22 18:52:40,193 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:40,193 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:40,193 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-11-22 18:52:40,193 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:40,194 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:40,194 INFO  L85        PathProgramCache]: Analyzing trace with hash 797715191, now seen corresponding path program 1 times
[2024-11-22 18:52:40,194 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:40,194 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317308883]
[2024-11-22 18:52:40,194 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:40,194 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:40,205 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:40,304 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-22 18:52:40,304 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:40,304 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317308883]
[2024-11-22 18:52:40,304 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317308883] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 18:52:40,304 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 18:52:40,304 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-22 18:52:40,305 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226060797]
[2024-11-22 18:52:40,305 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 18:52:40,305 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-22 18:52:40,305 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:40,306 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-22 18:52:40,306 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2024-11-22 18:52:40,306 INFO  L87              Difference]: Start difference. First operand 85 states and 92 transitions. Second operand  has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-22 18:52:40,386 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:40,386 INFO  L93              Difference]: Finished difference Result 90 states and 99 transitions.
[2024-11-22 18:52:40,386 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-11-22 18:52:40,387 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28
[2024-11-22 18:52:40,387 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:40,387 INFO  L225             Difference]: With dead ends: 90
[2024-11-22 18:52:40,387 INFO  L226             Difference]: Without dead ends: 90
[2024-11-22 18:52:40,387 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2024-11-22 18:52:40,388 INFO  L432           NwaCegarLoop]: 50 mSDtfsCounter, 24 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:40,388 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 322 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-22 18:52:40,389 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 90 states.
[2024-11-22 18:52:40,390 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89.
[2024-11-22 18:52:40,390 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 89 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 84 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-22 18:52:40,391 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions.
[2024-11-22 18:52:40,391 INFO  L78                 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 28
[2024-11-22 18:52:40,391 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:40,391 INFO  L471      AbstractCegarLoop]: Abstraction has 89 states and 99 transitions.
[2024-11-22 18:52:40,391 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-22 18:52:40,391 INFO  L276                IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions.
[2024-11-22 18:52:40,392 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2024-11-22 18:52:40,392 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:40,392 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:40,392 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-11-22 18:52:40,392 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:40,392 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:40,393 INFO  L85        PathProgramCache]: Analyzing trace with hash 1241356658, now seen corresponding path program 1 times
[2024-11-22 18:52:40,393 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:40,393 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939600813]
[2024-11-22 18:52:40,393 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:40,393 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:40,417 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:40,813 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 18:52:40,814 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:40,814 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939600813]
[2024-11-22 18:52:40,814 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939600813] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-22 18:52:40,814 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704557706]
[2024-11-22 18:52:40,814 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:40,814 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-22 18:52:40,814 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-22 18:52:40,817 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-22 18:52:40,818 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-22 18:52:40,911 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:40,913 INFO  L255         TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 33 conjuncts are in the unsatisfiable core
[2024-11-22 18:52:40,917 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 18:52:40,940 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1
[2024-11-22 18:52:40,981 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-11-22 18:52:40,981 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-11-22 18:52:40,995 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2024-11-22 18:52:40,999 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2024-11-22 18:52:41,064 INFO  L349             Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-22 18:52:41,065 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57
[2024-11-22 18:52:41,076 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13
[2024-11-22 18:52:41,100 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13
[2024-11-22 18:52:41,106 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3
[2024-11-22 18:52:41,112 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 18:52:41,112 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-22 18:52:41,112 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704557706] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 18:52:41,112 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-22 18:52:41,112 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 14
[2024-11-22 18:52:41,113 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209568360]
[2024-11-22 18:52:41,113 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 18:52:41,113 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-22 18:52:41,113 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:41,114 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-22 18:52:41,114 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210
[2024-11-22 18:52:41,114 INFO  L87              Difference]: Start difference. First operand 89 states and 99 transitions. Second operand  has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-22 18:52:41,302 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:41,302 INFO  L93              Difference]: Finished difference Result 90 states and 98 transitions.
[2024-11-22 18:52:41,303 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-11-22 18:52:41,303 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30
[2024-11-22 18:52:41,303 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:41,304 INFO  L225             Difference]: With dead ends: 90
[2024-11-22 18:52:41,304 INFO  L226             Difference]: Without dead ends: 90
[2024-11-22 18:52:41,304 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306
[2024-11-22 18:52:41,305 INFO  L432           NwaCegarLoop]: 45 mSDtfsCounter, 25 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:41,305 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 268 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-22 18:52:41,305 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 90 states.
[2024-11-22 18:52:41,306 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89.
[2024-11-22 18:52:41,307 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 89 states, 71 states have (on average 1.295774647887324) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-22 18:52:41,307 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions.
[2024-11-22 18:52:41,307 INFO  L78                 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 30
[2024-11-22 18:52:41,307 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:41,307 INFO  L471      AbstractCegarLoop]: Abstraction has 89 states and 98 transitions.
[2024-11-22 18:52:41,307 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-22 18:52:41,308 INFO  L276                IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions.
[2024-11-22 18:52:41,308 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2024-11-22 18:52:41,308 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:41,308 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:41,320 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-11-22 18:52:41,508 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2024-11-22 18:52:41,509 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:41,510 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:41,510 INFO  L85        PathProgramCache]: Analyzing trace with hash 1241356657, now seen corresponding path program 1 times
[2024-11-22 18:52:41,510 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:41,510 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576940806]
[2024-11-22 18:52:41,511 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:41,511 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:41,536 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:41,860 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 18:52:41,861 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:41,861 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576940806]
[2024-11-22 18:52:41,861 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576940806] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 18:52:41,861 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 18:52:41,861 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2024-11-22 18:52:41,861 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153099891]
[2024-11-22 18:52:41,861 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 18:52:41,861 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-11-22 18:52:41,861 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:41,862 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-11-22 18:52:41,862 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210
[2024-11-22 18:52:41,862 INFO  L87              Difference]: Start difference. First operand 89 states and 98 transitions. Second operand  has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-22 18:52:42,056 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:42,056 INFO  L93              Difference]: Finished difference Result 89 states and 97 transitions.
[2024-11-22 18:52:42,057 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-11-22 18:52:42,057 INFO  L78                 Accepts]: Start accepts. Automaton has  has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30
[2024-11-22 18:52:42,057 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:42,058 INFO  L225             Difference]: With dead ends: 89
[2024-11-22 18:52:42,058 INFO  L226             Difference]: Without dead ends: 89
[2024-11-22 18:52:42,058 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306
[2024-11-22 18:52:42,059 INFO  L432           NwaCegarLoop]: 43 mSDtfsCounter, 28 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:42,059 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 318 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-22 18:52:42,060 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 89 states.
[2024-11-22 18:52:42,061 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89.
[2024-11-22 18:52:42,061 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 89 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 84 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-22 18:52:42,062 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions.
[2024-11-22 18:52:42,062 INFO  L78                 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 30
[2024-11-22 18:52:42,062 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:42,062 INFO  L471      AbstractCegarLoop]: Abstraction has 89 states and 97 transitions.
[2024-11-22 18:52:42,062 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-22 18:52:42,063 INFO  L276                IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions.
[2024-11-22 18:52:42,063 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2024-11-22 18:52:42,063 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:42,063 INFO  L215           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:42,063 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-11-22 18:52:42,064 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:42,064 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:42,064 INFO  L85        PathProgramCache]: Analyzing trace with hash 679332107, now seen corresponding path program 1 times
[2024-11-22 18:52:42,064 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:42,064 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551363578]
[2024-11-22 18:52:42,064 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:42,065 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:42,081 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:42,549 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 18:52:42,550 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:42,550 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551363578]
[2024-11-22 18:52:42,550 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551363578] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-22 18:52:42,550 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878542455]
[2024-11-22 18:52:42,550 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:42,551 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-22 18:52:42,551 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-22 18:52:42,553 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-22 18:52:42,554 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-22 18:52:42,650 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:42,659 INFO  L255         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 59 conjuncts are in the unsatisfiable core
[2024-11-22 18:52:42,663 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 18:52:42,674 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-11-22 18:52:42,679 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-11-22 18:52:42,811 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11
[2024-11-22 18:52:42,817 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11
[2024-11-22 18:52:42,839 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11
[2024-11-22 18:52:42,844 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11
[2024-11-22 18:52:42,991 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-22 18:52:42,991 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15
[2024-11-22 18:52:42,998 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-22 18:52:42,999 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15
[2024-11-22 18:52:43,087 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-22 18:52:43,087 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-22 18:52:43,603 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18
[2024-11-22 18:52:43,607 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 106
[2024-11-22 18:52:43,616 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-22 18:52:43,616 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [878542455] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-22 18:52:43,617 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-22 18:52:43,617 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 31
[2024-11-22 18:52:43,617 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968496668]
[2024-11-22 18:52:43,617 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-22 18:52:43,617 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 31 states
[2024-11-22 18:52:43,618 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:43,618 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2024-11-22 18:52:43,619 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930
[2024-11-22 18:52:43,619 INFO  L87              Difference]: Start difference. First operand 89 states and 97 transitions. Second operand  has 31 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 28 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3)
[2024-11-22 18:52:44,287 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:44,287 INFO  L93              Difference]: Finished difference Result 103 states and 118 transitions.
[2024-11-22 18:52:44,287 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2024-11-22 18:52:44,288 INFO  L78                 Accepts]: Start accepts. Automaton has  has 31 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 28 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31
[2024-11-22 18:52:44,288 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:44,288 INFO  L225             Difference]: With dead ends: 103
[2024-11-22 18:52:44,288 INFO  L226             Difference]: Without dead ends: 103
[2024-11-22 18:52:44,289 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=122, Invalid=1360, Unknown=0, NotChecked=0, Total=1482
[2024-11-22 18:52:44,289 INFO  L432           NwaCegarLoop]: 38 mSDtfsCounter, 41 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:44,290 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 660 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-22 18:52:44,290 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 103 states.
[2024-11-22 18:52:44,292 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99.
[2024-11-22 18:52:44,292 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 99 states, 81 states have (on average 1.308641975308642) internal successors, (106), 94 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-22 18:52:44,293 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions.
[2024-11-22 18:52:44,293 INFO  L78                 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 31
[2024-11-22 18:52:44,293 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:44,293 INFO  L471      AbstractCegarLoop]: Abstraction has 99 states and 112 transitions.
[2024-11-22 18:52:44,293 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 31 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 28 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3)
[2024-11-22 18:52:44,294 INFO  L276                IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions.
[2024-11-22 18:52:44,294 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2024-11-22 18:52:44,294 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:44,294 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:44,304 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-11-22 18:52:44,498 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-22 18:52:44,499 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:44,499 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:44,499 INFO  L85        PathProgramCache]: Analyzing trace with hash -415542610, now seen corresponding path program 1 times
[2024-11-22 18:52:44,499 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:44,499 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304729691]
[2024-11-22 18:52:44,499 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:44,500 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:44,513 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:44,689 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-22 18:52:44,690 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:44,690 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304729691]
[2024-11-22 18:52:44,690 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304729691] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-22 18:52:44,690 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990764497]
[2024-11-22 18:52:44,690 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:44,690 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-22 18:52:44,690 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-22 18:52:44,691 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-22 18:52:44,692 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-11-22 18:52:44,798 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:44,799 INFO  L255         TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 26 conjuncts are in the unsatisfiable core
[2024-11-22 18:52:44,801 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 18:52:44,852 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2024-11-22 18:52:44,881 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-22 18:52:44,881 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-22 18:52:44,951 WARN  L851   $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_#t~ret4#1.base_18| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_18|) 0)) (= (store |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_18| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false
[2024-11-22 18:52:44,953 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990764497] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-22 18:52:44,953 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-22 18:52:44,953 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 11
[2024-11-22 18:52:44,953 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189072408]
[2024-11-22 18:52:44,954 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-22 18:52:44,954 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-11-22 18:52:44,954 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:44,955 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-11-22 18:52:44,955 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=111, Unknown=1, NotChecked=20, Total=156
[2024-11-22 18:52:44,955 INFO  L87              Difference]: Start difference. First operand 99 states and 112 transitions. Second operand  has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-22 18:52:45,140 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:45,141 INFO  L93              Difference]: Finished difference Result 106 states and 118 transitions.
[2024-11-22 18:52:45,141 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-11-22 18:52:45,141 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32
[2024-11-22 18:52:45,141 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:45,141 INFO  L225             Difference]: With dead ends: 106
[2024-11-22 18:52:45,142 INFO  L226             Difference]: Without dead ends: 89
[2024-11-22 18:52:45,142 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=111, Unknown=1, NotChecked=20, Total=156
[2024-11-22 18:52:45,142 INFO  L432           NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:45,142 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 327 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-22 18:52:45,143 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 89 states.
[2024-11-22 18:52:45,144 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89.
[2024-11-22 18:52:45,145 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 89 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 84 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-22 18:52:45,145 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions.
[2024-11-22 18:52:45,145 INFO  L78                 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 32
[2024-11-22 18:52:45,145 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:45,145 INFO  L471      AbstractCegarLoop]: Abstraction has 89 states and 101 transitions.
[2024-11-22 18:52:45,146 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-22 18:52:45,146 INFO  L276                IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions.
[2024-11-22 18:52:45,146 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2024-11-22 18:52:45,146 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:45,146 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:45,155 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-11-22 18:52:45,346 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-22 18:52:45,347 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:45,347 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:45,347 INFO  L85        PathProgramCache]: Analyzing trace with hash -1376283299, now seen corresponding path program 1 times
[2024-11-22 18:52:45,348 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:45,348 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604885438]
[2024-11-22 18:52:45,348 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:45,348 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:45,365 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:45,443 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-22 18:52:45,443 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:45,443 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604885438]
[2024-11-22 18:52:45,443 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604885438] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-22 18:52:45,443 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677888881]
[2024-11-22 18:52:45,443 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:45,444 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-22 18:52:45,444 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-22 18:52:45,446 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-22 18:52:45,447 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-11-22 18:52:45,569 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:45,571 INFO  L255         TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 19 conjuncts are in the unsatisfiable core
[2024-11-22 18:52:45,576 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 18:52:45,617 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-22 18:52:45,617 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-22 18:52:45,651 INFO  L349             Elim1Store]: treesize reduction 5, result has 37.5 percent of original size
[2024-11-22 18:52:45,651 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11
[2024-11-22 18:52:45,673 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-22 18:52:45,674 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677888881] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-22 18:52:45,674 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-22 18:52:45,674 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6
[2024-11-22 18:52:45,674 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588315459]
[2024-11-22 18:52:45,674 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-22 18:52:45,674 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-22 18:52:45,675 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:45,675 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-22 18:52:45,675 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-11-22 18:52:45,675 INFO  L87              Difference]: Start difference. First operand 89 states and 101 transitions. Second operand  has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-22 18:52:45,759 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:45,759 INFO  L93              Difference]: Finished difference Result 98 states and 113 transitions.
[2024-11-22 18:52:45,760 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-22 18:52:45,761 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40
[2024-11-22 18:52:45,761 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:45,762 INFO  L225             Difference]: With dead ends: 98
[2024-11-22 18:52:45,762 INFO  L226             Difference]: Without dead ends: 98
[2024-11-22 18:52:45,762 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-11-22 18:52:45,763 INFO  L432           NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:45,763 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 186 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-22 18:52:45,763 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 98 states.
[2024-11-22 18:52:45,768 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97.
[2024-11-22 18:52:45,769 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 97 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 92 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-22 18:52:45,769 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions.
[2024-11-22 18:52:45,770 INFO  L78                 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 40
[2024-11-22 18:52:45,770 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:45,770 INFO  L471      AbstractCegarLoop]: Abstraction has 97 states and 111 transitions.
[2024-11-22 18:52:45,771 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-22 18:52:45,771 INFO  L276                IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions.
[2024-11-22 18:52:45,771 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2024-11-22 18:52:45,771 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:45,771 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:45,778 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-11-22 18:52:45,972 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-22 18:52:45,972 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:45,972 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:45,973 INFO  L85        PathProgramCache]: Analyzing trace with hash -1376283298, now seen corresponding path program 1 times
[2024-11-22 18:52:45,973 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:45,973 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813954926]
[2024-11-22 18:52:45,973 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:45,973 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:45,989 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:46,216 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-22 18:52:46,217 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:46,217 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813954926]
[2024-11-22 18:52:46,217 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813954926] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-22 18:52:46,217 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232115563]
[2024-11-22 18:52:46,217 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:46,217 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-22 18:52:46,217 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-22 18:52:46,220 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-22 18:52:46,221 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-11-22 18:52:46,343 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:46,345 INFO  L255         TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 31 conjuncts are in the unsatisfiable core
[2024-11-22 18:52:46,347 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 18:52:46,535 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-22 18:52:46,535 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-22 18:52:46,659 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-22 18:52:46,659 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25
[2024-11-22 18:52:46,819 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-22 18:52:46,819 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232115563] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-22 18:52:46,819 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-22 18:52:46,820 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23
[2024-11-22 18:52:46,820 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28761067]
[2024-11-22 18:52:46,820 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-22 18:52:46,820 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2024-11-22 18:52:46,820 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:46,821 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2024-11-22 18:52:46,821 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552
[2024-11-22 18:52:46,821 INFO  L87              Difference]: Start difference. First operand 97 states and 111 transitions. Second operand  has 24 states, 23 states have (on average 4.173913043478261) internal successors, (96), 21 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6)
[2024-11-22 18:52:46,962 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:46,963 INFO  L93              Difference]: Finished difference Result 98 states and 112 transitions.
[2024-11-22 18:52:46,963 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-11-22 18:52:46,963 INFO  L78                 Accepts]: Start accepts. Automaton has  has 24 states, 23 states have (on average 4.173913043478261) internal successors, (96), 21 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40
[2024-11-22 18:52:46,963 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:46,964 INFO  L225             Difference]: With dead ends: 98
[2024-11-22 18:52:46,964 INFO  L226             Difference]: Without dead ends: 98
[2024-11-22 18:52:46,964 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552
[2024-11-22 18:52:46,965 INFO  L432           NwaCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:46,965 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 441 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-22 18:52:46,965 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 98 states.
[2024-11-22 18:52:46,969 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97.
[2024-11-22 18:52:46,970 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 97 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 92 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-22 18:52:46,970 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions.
[2024-11-22 18:52:46,970 INFO  L78                 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 40
[2024-11-22 18:52:46,970 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:46,970 INFO  L471      AbstractCegarLoop]: Abstraction has 97 states and 110 transitions.
[2024-11-22 18:52:46,971 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 23 states have (on average 4.173913043478261) internal successors, (96), 21 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6)
[2024-11-22 18:52:46,971 INFO  L276                IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions.
[2024-11-22 18:52:46,974 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2024-11-22 18:52:46,974 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:46,974 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:46,983 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-11-22 18:52:47,178 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-22 18:52:47,179 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:47,179 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:47,179 INFO  L85        PathProgramCache]: Analyzing trace with hash -7678024, now seen corresponding path program 1 times
[2024-11-22 18:52:47,179 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:47,179 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141764768]
[2024-11-22 18:52:47,179 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:47,180 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:47,200 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:47,881 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 18:52:47,881 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:47,881 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141764768]
[2024-11-22 18:52:47,881 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141764768] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-22 18:52:47,882 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888006939]
[2024-11-22 18:52:47,882 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:47,882 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-22 18:52:47,882 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-22 18:52:47,884 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-22 18:52:47,886 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-11-22 18:52:48,013 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:48,015 INFO  L255         TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 58 conjuncts are in the unsatisfiable core
[2024-11-22 18:52:48,022 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 18:52:48,053 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1
[2024-11-22 18:52:48,123 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-11-22 18:52:48,124 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-11-22 18:52:48,165 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2024-11-22 18:52:48,171 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2024-11-22 18:52:48,267 INFO  L349             Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-22 18:52:48,267 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66
[2024-11-22 18:52:48,281 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13
[2024-11-22 18:52:48,397 INFO  L349             Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-22 18:52:48,397 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66
[2024-11-22 18:52:48,407 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13
[2024-11-22 18:52:48,425 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18
[2024-11-22 18:52:48,433 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3
[2024-11-22 18:52:48,565 WARN  L873   $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true
[2024-11-22 18:52:48,605 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-11-22 18:52:48,606 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9
[2024-11-22 18:52:48,613 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-11-22 18:52:48,613 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-11-22 18:52:48,644 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked.
[2024-11-22 18:52:48,644 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-22 18:52:48,765 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888006939] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-22 18:52:48,765 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-22 18:52:48,765 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 30
[2024-11-22 18:52:48,765 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105686409]
[2024-11-22 18:52:48,765 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-22 18:52:48,766 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 31 states
[2024-11-22 18:52:48,766 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:48,767 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2024-11-22 18:52:48,767 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=907, Unknown=1, NotChecked=60, Total=1056
[2024-11-22 18:52:48,767 INFO  L87              Difference]: Start difference. First operand 97 states and 110 transitions. Second operand  has 31 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 24 states have internal predecessors, (64), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6)
[2024-11-22 18:52:49,490 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:49,490 INFO  L93              Difference]: Finished difference Result 92 states and 105 transitions.
[2024-11-22 18:52:49,490 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-11-22 18:52:49,490 INFO  L78                 Accepts]: Start accepts. Automaton has  has 31 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 24 states have internal predecessors, (64), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 42
[2024-11-22 18:52:49,491 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:49,491 INFO  L225             Difference]: With dead ends: 92
[2024-11-22 18:52:49,491 INFO  L226             Difference]: Without dead ends: 92
[2024-11-22 18:52:49,492 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=220, Invalid=1763, Unknown=1, NotChecked=86, Total=2070
[2024-11-22 18:52:49,492 INFO  L432           NwaCegarLoop]: 47 mSDtfsCounter, 57 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:49,493 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 720 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 605 Invalid, 0 Unknown, 66 Unchecked, 0.3s Time]
[2024-11-22 18:52:49,493 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2024-11-22 18:52:49,494 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92.
[2024-11-22 18:52:49,495 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 92 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 87 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-22 18:52:49,495 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions.
[2024-11-22 18:52:49,495 INFO  L78                 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 42
[2024-11-22 18:52:49,495 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:49,496 INFO  L471      AbstractCegarLoop]: Abstraction has 92 states and 105 transitions.
[2024-11-22 18:52:49,496 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 31 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 24 states have internal predecessors, (64), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6)
[2024-11-22 18:52:49,496 INFO  L276                IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions.
[2024-11-22 18:52:49,496 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2024-11-22 18:52:49,496 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:49,496 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:49,508 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-11-22 18:52:49,697 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23
[2024-11-22 18:52:49,697 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:49,697 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:49,697 INFO  L85        PathProgramCache]: Analyzing trace with hash -7678025, now seen corresponding path program 1 times
[2024-11-22 18:52:49,697 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:49,697 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75796088]
[2024-11-22 18:52:49,698 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:49,698 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:49,725 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:50,204 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-22 18:52:50,205 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:50,205 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75796088]
[2024-11-22 18:52:50,205 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75796088] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-22 18:52:50,205 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10853738]
[2024-11-22 18:52:50,205 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:50,205 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-22 18:52:50,205 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-22 18:52:50,208 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-22 18:52:50,208 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-11-22 18:52:50,331 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:50,334 INFO  L255         TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 38 conjuncts are in the unsatisfiable core
[2024-11-22 18:52:50,336 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 18:52:50,373 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-11-22 18:52:50,374 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-11-22 18:52:50,395 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2024-11-22 18:52:50,440 INFO  L349             Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-22 18:52:50,440 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41
[2024-11-22 18:52:50,489 INFO  L349             Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-22 18:52:50,489 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41
[2024-11-22 18:52:50,500 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13
[2024-11-22 18:52:50,514 WARN  L873   $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base 1))) is different from true
[2024-11-22 18:52:50,546 INFO  L349             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-11-22 18:52:50,547 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14
[2024-11-22 18:52:50,556 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked.
[2024-11-22 18:52:50,556 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-22 18:52:50,755 INFO  L349             Elim1Store]: treesize reduction 5, result has 82.8 percent of original size
[2024-11-22 18:52:50,755 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32
[2024-11-22 18:52:50,761 WARN  L851   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1021 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1020))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_1021)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)))) is different from false
[2024-11-22 18:52:50,777 WARN  L851   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1021 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1020))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_1021)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))))) is different from false
[2024-11-22 18:52:50,787 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-22 18:52:50,787 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 35
[2024-11-22 18:52:50,790 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 126
[2024-11-22 18:52:50,797 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-11-22 18:52:50,799 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16
[2024-11-22 18:52:50,892 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 18:52:50,892 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [10853738] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-22 18:52:50,892 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-22 18:52:50,892 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 14] total 31
[2024-11-22 18:52:50,892 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690942748]
[2024-11-22 18:52:50,892 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-22 18:52:50,893 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2024-11-22 18:52:50,893 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:50,893 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2024-11-22 18:52:50,894 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=705, Unknown=25, NotChecked=168, Total=992
[2024-11-22 18:52:50,894 INFO  L87              Difference]: Start difference. First operand 92 states and 105 transitions. Second operand  has 32 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 27 states have internal predecessors, (76), 3 states have call successors, (4), 4 states have call predecessors, (4), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8)
[2024-11-22 18:52:51,279 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:51,279 INFO  L93              Difference]: Finished difference Result 91 states and 104 transitions.
[2024-11-22 18:52:51,279 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-11-22 18:52:51,280 INFO  L78                 Accepts]: Start accepts. Automaton has  has 32 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 27 states have internal predecessors, (76), 3 states have call successors, (4), 4 states have call predecessors, (4), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 42
[2024-11-22 18:52:51,280 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:51,281 INFO  L225             Difference]: With dead ends: 91
[2024-11-22 18:52:51,281 INFO  L226             Difference]: Without dead ends: 91
[2024-11-22 18:52:51,281 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=1026, Unknown=27, NotChecked=204, Total=1406
[2024-11-22 18:52:51,282 INFO  L432           NwaCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:51,282 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 625 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 428 Invalid, 0 Unknown, 108 Unchecked, 0.2s Time]
[2024-11-22 18:52:51,283 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 91 states.
[2024-11-22 18:52:51,284 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91.
[2024-11-22 18:52:51,284 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 91 states, 79 states have (on average 1.240506329113924) internal successors, (98), 86 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-22 18:52:51,285 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions.
[2024-11-22 18:52:51,285 INFO  L78                 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 42
[2024-11-22 18:52:51,285 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:51,285 INFO  L471      AbstractCegarLoop]: Abstraction has 91 states and 104 transitions.
[2024-11-22 18:52:51,286 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 27 states have internal predecessors, (76), 3 states have call successors, (4), 4 states have call predecessors, (4), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8)
[2024-11-22 18:52:51,286 INFO  L276                IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions.
[2024-11-22 18:52:51,286 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2024-11-22 18:52:51,286 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:51,286 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:51,296 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2024-11-22 18:52:51,487 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24
[2024-11-22 18:52:51,487 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:51,487 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:51,487 INFO  L85        PathProgramCache]: Analyzing trace with hash 324547288, now seen corresponding path program 1 times
[2024-11-22 18:52:51,488 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:51,488 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546757589]
[2024-11-22 18:52:51,488 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:51,488 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:51,507 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:52,242 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 18:52:52,243 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:52,243 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546757589]
[2024-11-22 18:52:52,243 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546757589] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-22 18:52:52,243 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697225886]
[2024-11-22 18:52:52,243 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:52,243 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-22 18:52:52,243 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-22 18:52:52,244 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-22 18:52:52,245 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2024-11-22 18:52:52,374 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:52,376 INFO  L255         TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 51 conjuncts are in the unsatisfiable core
[2024-11-22 18:52:52,378 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 18:52:52,497 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-11-22 18:52:52,497 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-11-22 18:52:52,528 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2024-11-22 18:52:52,626 INFO  L349             Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-22 18:52:52,626 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32
[2024-11-22 18:52:52,679 INFO  L349             Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-22 18:52:52,680 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41
[2024-11-22 18:52:52,793 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13
[2024-11-22 18:52:52,799 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 18:52:52,799 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-22 18:52:52,895 INFO  L349             Elim1Store]: treesize reduction 5, result has 70.6 percent of original size
[2024-11-22 18:52:52,895 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20
[2024-11-22 18:52:52,937 WARN  L851   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1118) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4))))) is different from false
[2024-11-22 18:52:52,943 WARN  L851   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int)) (v_ArrVal_1117 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1117))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1118) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)))))) is different from false
[2024-11-22 18:52:52,998 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-22 18:52:52,998 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 44
[2024-11-22 18:52:53,010 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-22 18:52:53,011 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 498 treesize of output 395
[2024-11-22 18:52:53,030 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-22 18:52:53,031 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 335 treesize of output 279
[2024-11-22 18:52:53,037 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 271 treesize of output 239
[2024-11-22 18:52:53,234 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [697225886] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-22 18:52:53,234 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-22 18:52:53,234 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 30
[2024-11-22 18:52:53,234 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452099530]
[2024-11-22 18:52:53,235 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-22 18:52:53,235 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 31 states
[2024-11-22 18:52:53,235 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:53,235 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2024-11-22 18:52:53,236 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1196, Unknown=24, NotChecked=142, Total=1482
[2024-11-22 18:52:53,236 INFO  L87              Difference]: Start difference. First operand 91 states and 104 transitions. Second operand  has 31 states, 30 states have (on average 2.433333333333333) internal successors, (73), 27 states have internal predecessors, (73), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-22 18:52:53,729 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:53,729 INFO  L93              Difference]: Finished difference Result 96 states and 112 transitions.
[2024-11-22 18:52:53,729 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2024-11-22 18:52:53,729 INFO  L78                 Accepts]: Start accepts. Automaton has  has 31 states, 30 states have (on average 2.433333333333333) internal successors, (73), 27 states have internal predecessors, (73), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 44
[2024-11-22 18:52:53,730 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:53,730 INFO  L225             Difference]: With dead ends: 96
[2024-11-22 18:52:53,730 INFO  L226             Difference]: Without dead ends: 96
[2024-11-22 18:52:53,731 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=197, Invalid=1767, Unknown=24, NotChecked=174, Total=2162
[2024-11-22 18:52:53,731 INFO  L432           NwaCegarLoop]: 38 mSDtfsCounter, 17 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:53,731 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 741 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-22 18:52:53,732 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2024-11-22 18:52:53,735 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95.
[2024-11-22 18:52:53,735 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 95 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 90 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-22 18:52:53,736 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions.
[2024-11-22 18:52:53,736 INFO  L78                 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 44
[2024-11-22 18:52:53,736 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:53,736 INFO  L471      AbstractCegarLoop]: Abstraction has 95 states and 110 transitions.
[2024-11-22 18:52:53,736 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 31 states, 30 states have (on average 2.433333333333333) internal successors, (73), 27 states have internal predecessors, (73), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-22 18:52:53,736 INFO  L276                IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions.
[2024-11-22 18:52:53,737 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2024-11-22 18:52:53,737 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:53,737 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:53,749 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2024-11-22 18:52:53,937 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25
[2024-11-22 18:52:53,937 INFO  L396      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:53,938 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:53,938 INFO  L85        PathProgramCache]: Analyzing trace with hash 324547289, now seen corresponding path program 1 times
[2024-11-22 18:52:53,938 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:53,938 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622428664]
[2024-11-22 18:52:53,938 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:53,938 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:53,963 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:54,854 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 18:52:54,855 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:54,855 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622428664]
[2024-11-22 18:52:54,855 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622428664] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-22 18:52:54,855 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543979033]
[2024-11-22 18:52:54,855 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:54,855 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-22 18:52:54,855 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-22 18:52:54,858 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-22 18:52:54,860 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2024-11-22 18:52:55,003 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:55,007 INFO  L255         TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 67 conjuncts are in the unsatisfiable core
[2024-11-22 18:52:55,010 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 18:52:55,171 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1
[2024-11-22 18:52:55,236 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-11-22 18:52:55,236 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-11-22 18:52:55,291 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2024-11-22 18:52:55,300 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2024-11-22 18:52:55,454 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-11-22 18:52:55,455 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 41
[2024-11-22 18:52:55,465 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13
[2024-11-22 18:52:55,554 INFO  L349             Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-22 18:52:55,554 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57
[2024-11-22 18:52:55,563 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13
[2024-11-22 18:52:55,737 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13
[2024-11-22 18:52:55,746 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3
[2024-11-22 18:52:55,803 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 18:52:55,803 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-22 18:52:56,017 WARN  L851   $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4))) (and (forall ((v_ArrVal_1218 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1218) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1218 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1218) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1219) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0)))))) is different from false
[2024-11-22 18:52:56,043 WARN  L851   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4))) (and (forall ((v_ArrVal_1218 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1218) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)))) (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1218 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1218) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1219) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)))))) is different from false
[2024-11-22 18:52:56,070 WARN  L851   $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base|))) (and (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1217 Int)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1216) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse0 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_1217)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_1218) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2) 4))) (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1217 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse0 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_1217)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1216) .cse3 v_ArrVal_1218) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1219) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2)))))))) is different from false
[2024-11-22 18:52:56,109 WARN  L851   $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (let ((.cse3 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse1 (select |c_#memory_$Pointer$#0.base| .cse0)) (.cse4 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (and (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_24| Int)) (or (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1217 Int)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1216) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 (store .cse1 |v_ULTIMATE.start_create_#t~mem9#1.offset_24| v_ArrVal_1217)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_1218) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3) 4))) (< .cse4 |v_ULTIMATE.start_create_#t~mem9#1.offset_24|))) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_24| Int)) (or (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1217 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#0.base| .cse0 (store .cse1 |v_ULTIMATE.start_create_#t~mem9#1.offset_24| v_ArrVal_1217)))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1216) .cse5 v_ArrVal_1218) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3) 12) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1219) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3)))))) (< .cse4 |v_ULTIMATE.start_create_#t~mem9#1.offset_24|))))))) is different from false
[2024-11-22 18:52:56,156 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-22 18:52:56,156 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 135
[2024-11-22 18:52:56,195 INFO  L349             Elim1Store]: treesize reduction 19, result has 68.3 percent of original size
[2024-11-22 18:52:56,195 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 129
[2024-11-22 18:52:56,242 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-22 18:52:56,243 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 374 treesize of output 361
[2024-11-22 18:52:56,314 INFO  L349             Elim1Store]: treesize reduction 40, result has 50.0 percent of original size
[2024-11-22 18:52:56,314 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 276 treesize of output 271
[2024-11-22 18:52:56,330 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 95
[2024-11-22 18:52:56,346 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 142
[2024-11-22 18:52:56,368 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-22 18:52:56,368 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 116
[2024-11-22 18:52:56,382 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 120
[2024-11-22 18:52:56,441 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4
[2024-11-22 18:52:56,454 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4
[2024-11-22 18:52:56,597 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4
[2024-11-22 18:52:56,610 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-22 18:52:56,611 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 59
[2024-11-22 18:52:56,642 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14
[2024-11-22 18:52:56,661 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-22 18:52:56,662 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 62
[2024-11-22 18:52:56,665 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-11-22 18:52:56,667 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-11-22 18:52:56,670 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-11-22 18:52:56,671 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10
[2024-11-22 18:52:56,813 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [543979033] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-22 18:52:56,813 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-22 18:52:56,813 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35
[2024-11-22 18:52:56,814 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169001161]
[2024-11-22 18:52:56,814 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-22 18:52:56,814 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 36 states
[2024-11-22 18:52:56,814 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:56,815 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2024-11-22 18:52:56,816 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1663, Unknown=4, NotChecked=340, Total=2162
[2024-11-22 18:52:56,816 INFO  L87              Difference]: Start difference. First operand 95 states and 110 transitions. Second operand  has 36 states, 35 states have (on average 2.2285714285714286) internal successors, (78), 31 states have internal predecessors, (78), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-22 18:52:57,438 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:57,438 INFO  L93              Difference]: Finished difference Result 96 states and 111 transitions.
[2024-11-22 18:52:57,439 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2024-11-22 18:52:57,439 INFO  L78                 Accepts]: Start accepts. Automaton has  has 36 states, 35 states have (on average 2.2285714285714286) internal successors, (78), 31 states have internal predecessors, (78), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 44
[2024-11-22 18:52:57,439 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:57,439 INFO  L225             Difference]: With dead ends: 96
[2024-11-22 18:52:57,439 INFO  L226             Difference]: Without dead ends: 96
[2024-11-22 18:52:57,440 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=230, Invalid=2332, Unknown=4, NotChecked=404, Total=2970
[2024-11-22 18:52:57,440 INFO  L432           NwaCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:57,441 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 743 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-22 18:52:57,441 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2024-11-22 18:52:57,443 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95.
[2024-11-22 18:52:57,443 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 95 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 90 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-22 18:52:57,444 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions.
[2024-11-22 18:52:57,444 INFO  L78                 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 44
[2024-11-22 18:52:57,444 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:57,444 INFO  L471      AbstractCegarLoop]: Abstraction has 95 states and 109 transitions.
[2024-11-22 18:52:57,444 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 36 states, 35 states have (on average 2.2285714285714286) internal successors, (78), 31 states have internal predecessors, (78), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-22 18:52:57,444 INFO  L276                IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions.
[2024-11-22 18:52:57,444 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2024-11-22 18:52:57,444 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:57,445 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:57,451 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0
[2024-11-22 18:52:57,645 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26
[2024-11-22 18:52:57,645 INFO  L396      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:57,646 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:57,646 INFO  L85        PathProgramCache]: Analyzing trace with hash 1470979996, now seen corresponding path program 1 times
[2024-11-22 18:52:57,646 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:57,646 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719220534]
[2024-11-22 18:52:57,646 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:57,646 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:57,665 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:57,749 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-22 18:52:57,749 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:57,750 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719220534]
[2024-11-22 18:52:57,750 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719220534] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-22 18:52:57,750 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046990983]
[2024-11-22 18:52:57,750 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:57,750 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-22 18:52:57,750 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-22 18:52:57,753 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-22 18:52:57,754 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2024-11-22 18:52:57,891 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:57,892 INFO  L255         TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 19 conjuncts are in the unsatisfiable core
[2024-11-22 18:52:57,893 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 18:52:57,933 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-22 18:52:57,933 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-22 18:52:57,966 INFO  L349             Elim1Store]: treesize reduction 5, result has 37.5 percent of original size
[2024-11-22 18:52:57,966 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11
[2024-11-22 18:52:57,980 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-22 18:52:57,980 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046990983] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-22 18:52:57,980 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-22 18:52:57,980 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7
[2024-11-22 18:52:57,981 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376077012]
[2024-11-22 18:52:57,981 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-22 18:52:57,981 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-22 18:52:57,981 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:57,981 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-22 18:52:57,981 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-11-22 18:52:57,981 INFO  L87              Difference]: Start difference. First operand 95 states and 109 transitions. Second operand  has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-22 18:52:58,054 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:58,054 INFO  L93              Difference]: Finished difference Result 108 states and 126 transitions.
[2024-11-22 18:52:58,054 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-22 18:52:58,054 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45
[2024-11-22 18:52:58,054 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:58,055 INFO  L225             Difference]: With dead ends: 108
[2024-11-22 18:52:58,055 INFO  L226             Difference]: Without dead ends: 108
[2024-11-22 18:52:58,055 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-11-22 18:52:58,056 INFO  L432           NwaCegarLoop]: 35 mSDtfsCounter, 17 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:58,056 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 172 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-22 18:52:58,057 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 108 states.
[2024-11-22 18:52:58,059 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105.
[2024-11-22 18:52:58,059 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 105 states, 93 states have (on average 1.2688172043010753) internal successors, (118), 100 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-22 18:52:58,059 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions.
[2024-11-22 18:52:58,060 INFO  L78                 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 45
[2024-11-22 18:52:58,060 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:58,060 INFO  L471      AbstractCegarLoop]: Abstraction has 105 states and 124 transitions.
[2024-11-22 18:52:58,060 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-22 18:52:58,060 INFO  L276                IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions.
[2024-11-22 18:52:58,060 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2024-11-22 18:52:58,060 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:58,060 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:58,068 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0
[2024-11-22 18:52:58,261 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27
[2024-11-22 18:52:58,261 INFO  L396      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:58,261 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:58,261 INFO  L85        PathProgramCache]: Analyzing trace with hash 1470979997, now seen corresponding path program 1 times
[2024-11-22 18:52:58,261 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:58,261 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016379425]
[2024-11-22 18:52:58,262 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:58,262 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:58,279 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:58,468 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-11-22 18:52:58,468 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:52:58,469 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016379425]
[2024-11-22 18:52:58,469 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016379425] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-22 18:52:58,469 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540732622]
[2024-11-22 18:52:58,469 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 18:52:58,469 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-22 18:52:58,469 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-22 18:52:58,471 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-22 18:52:58,472 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2024-11-22 18:52:58,611 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 18:52:58,613 INFO  L255         TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 30 conjuncts are in the unsatisfiable core
[2024-11-22 18:52:58,615 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 18:52:58,826 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-22 18:52:58,827 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-22 18:52:59,001 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-22 18:52:59,001 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19
[2024-11-22 18:52:59,155 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-22 18:52:59,155 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540732622] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-22 18:52:59,155 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-22 18:52:59,155 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 26
[2024-11-22 18:52:59,155 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375417042]
[2024-11-22 18:52:59,155 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-22 18:52:59,156 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2024-11-22 18:52:59,156 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 18:52:59,156 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2024-11-22 18:52:59,156 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702
[2024-11-22 18:52:59,157 INFO  L87              Difference]: Start difference. First operand 105 states and 124 transitions. Second operand  has 27 states, 26 states have (on average 4.076923076923077) internal successors, (106), 25 states have internal predecessors, (106), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5)
[2024-11-22 18:52:59,482 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 18:52:59,482 INFO  L93              Difference]: Finished difference Result 108 states and 121 transitions.
[2024-11-22 18:52:59,482 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2024-11-22 18:52:59,483 INFO  L78                 Accepts]: Start accepts. Automaton has  has 27 states, 26 states have (on average 4.076923076923077) internal successors, (106), 25 states have internal predecessors, (106), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 45
[2024-11-22 18:52:59,483 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 18:52:59,484 INFO  L225             Difference]: With dead ends: 108
[2024-11-22 18:52:59,484 INFO  L226             Difference]: Without dead ends: 108
[2024-11-22 18:52:59,484 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992
[2024-11-22 18:52:59,486 INFO  L432           NwaCegarLoop]: 33 mSDtfsCounter, 50 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-22 18:52:59,486 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 532 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-22 18:52:59,487 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 108 states.
[2024-11-22 18:52:59,492 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105.
[2024-11-22 18:52:59,493 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 105 states, 93 states have (on average 1.2150537634408602) internal successors, (113), 100 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-22 18:52:59,493 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions.
[2024-11-22 18:52:59,493 INFO  L78                 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 45
[2024-11-22 18:52:59,493 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 18:52:59,494 INFO  L471      AbstractCegarLoop]: Abstraction has 105 states and 119 transitions.
[2024-11-22 18:52:59,494 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 26 states have (on average 4.076923076923077) internal successors, (106), 25 states have internal predecessors, (106), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5)
[2024-11-22 18:52:59,494 INFO  L276                IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions.
[2024-11-22 18:52:59,494 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2024-11-22 18:52:59,494 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 18:52:59,494 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-22 18:52:59,504 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0
[2024-11-22 18:52:59,695 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28
[2024-11-22 18:52:59,695 INFO  L396      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] ===
[2024-11-22 18:52:59,695 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 18:52:59,695 INFO  L85        PathProgramCache]: Analyzing trace with hash 1944558291, now seen corresponding path program 2 times
[2024-11-22 18:52:59,696 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 18:52:59,696 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326847729]
[2024-11-22 18:52:59,696 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-22 18:52:59,696 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 18:52:59,723 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-22 18:52:59,723 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-22 18:53:01,040 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 18:53:01,041 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 18:53:01,041 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326847729]
[2024-11-22 18:53:01,041 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326847729] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-22 18:53:01,041 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878974887]
[2024-11-22 18:53:01,041 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-22 18:53:01,041 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-22 18:53:01,041 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-22 18:53:01,042 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-22 18:53:01,044 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2024-11-22 18:53:01,200 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-22 18:53:01,200 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-22 18:53:01,202 INFO  L255         TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 88 conjuncts are in the unsatisfiable core
[2024-11-22 18:53:01,205 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 18:53:01,207 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-11-22 18:53:01,332 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-11-22 18:53:01,336 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-11-22 18:53:01,369 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-11-22 18:53:01,370 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-11-22 18:53:01,425 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17
[2024-11-22 18:53:01,433 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26
[2024-11-22 18:53:01,594 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-11-22 18:53:01,607 INFO  L349             Elim1Store]: treesize reduction 47, result has 16.1 percent of original size
[2024-11-22 18:53:01,607 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 60
[2024-11-22 18:53:01,614 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-11-22 18:53:01,614 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 29
[2024-11-22 18:53:01,728 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-11-22 18:53:01,755 INFO  L349             Elim1Store]: treesize reduction 49, result has 15.5 percent of original size
[2024-11-22 18:53:01,755 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 68
[2024-11-22 18:53:01,766 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-11-22 18:53:01,767 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 29
[2024-11-22 18:53:02,135 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-22 18:53:02,136 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-22 18:53:02,416 WARN  L851   $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base|)) (.cse2 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base|)) (.cse3 (+ |c_ULTIMATE.start_create_#t~mem11#1.offset| 12)) (.cse1 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4))) (and (forall ((v_ArrVal_1512 (Array Int Int))) (or (forall ((v_ArrVal_1510 Int)) (= (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| (store .cse2 .cse3 v_ArrVal_1510)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1512) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 4)) 0)) (not (= v_ArrVal_1512 (store .cse4 .cse3 (select v_ArrVal_1512 .cse3)))))) (forall ((v_ArrVal_1512 (Array Int Int))) (or (not (= v_ArrVal_1512 (store .cse4 .cse3 (select v_ArrVal_1512 .cse3)))) (forall ((v_ArrVal_1510 Int)) (= (let ((.cse5 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1512))) (select (select .cse5 (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| (store .cse2 .cse3 v_ArrVal_1510)) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)) (+ (select (select .cse5 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 4))) 0)))))) is different from false
[2024-11-22 18:53:02,454 WARN  L851   $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse9))) (let ((.cse3 (select |c_#memory_$Pointer$#0.base| .cse2)) (.cse5 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse6 (select |c_#memory_$Pointer$#0.offset| .cse2)) (.cse0 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse9))) (and (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_33| Int)) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_33| .cse0) (forall ((v_ArrVal_1512 (Array Int Int))) (let ((.cse4 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_33| 12))) (or (forall ((v_ArrVal_1510 Int)) (= (let ((.cse1 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_1512))) (select (select .cse1 (select (select (store |c_#memory_$Pointer$#0.base| .cse2 (store .cse3 .cse4 v_ArrVal_1510)) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse5)) (+ (select (select .cse1 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse5) 4))) 0)) (not (= v_ArrVal_1512 (store .cse6 .cse4 (select v_ArrVal_1512 .cse4))))))))) (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_33| Int)) (or (forall ((v_ArrVal_1512 (Array Int Int))) (let ((.cse8 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_33| 12))) (or (forall ((v_ArrVal_1510 Int)) (= (select (let ((.cse7 (store |c_#memory_$Pointer$#0.base| .cse2 (store .cse3 .cse8 v_ArrVal_1510)))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse5))) (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_1512) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse5) 4)) 0)) (not (= v_ArrVal_1512 (store .cse6 .cse8 (select v_ArrVal_1512 .cse8))))))) (< |v_ULTIMATE.start_create_#t~mem11#1.offset_33| .cse0))))))) is different from false
[2024-11-22 18:53:02,512 WARN  L851   $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)) (.cse7 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base|)) (.cse8 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base|))) (and (forall ((v_ArrVal_1507 Int) (v_ArrVal_1506 Int) (|v_ULTIMATE.start_create_#t~mem11#1.offset_33| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse8 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_1506)))) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_33| (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (forall ((v_ArrVal_1512 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse7 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_1507)))) (let ((.cse3 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_33| 12)) (.cse2 (select (select .cse6 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (or (not (= v_ArrVal_1512 (store (select .cse0 .cse2) .cse3 (select v_ArrVal_1512 .cse3)))) (forall ((v_ArrVal_1510 Int)) (= (select (let ((.cse4 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 v_ArrVal_1510)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse5))) (+ (select (select (store .cse0 .cse2 v_ArrVal_1512) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse5) 4)) 0))))))))) (forall ((v_ArrVal_1507 Int) (v_ArrVal_1506 Int) (|v_ULTIMATE.start_create_#t~mem11#1.offset_33| Int)) (let ((.cse9 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse8 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_1506)))) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_33| (select (select .cse9 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (forall ((v_ArrVal_1512 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse7 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_1507)))) (let ((.cse11 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_33| 12)) (.cse10 (select (select .cse13 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (or (not (= v_ArrVal_1512 (store (select .cse9 .cse10) .cse11 (select v_ArrVal_1512 .cse11)))) (forall ((v_ArrVal_1510 Int)) (= (let ((.cse12 (store .cse9 .cse10 v_ArrVal_1512))) (select (select .cse12 (select (select (store .cse13 .cse10 (store (select .cse13 .cse10) .cse11 v_ArrVal_1510)) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse5)) (+ (select (select .cse12 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse5) 4))) 0))))))))))) is different from false
[2024-11-22 18:53:02,607 WARN  L851   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (let ((.cse10 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (.cse3 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse8 (select |c_#memory_$Pointer$#0.base| .cse7)) (.cse9 (select |c_#memory_$Pointer$#0.offset| .cse7))) (and (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_34| Int)) (or (forall ((v_ArrVal_1507 Int) (v_ArrVal_1506 Int) (|v_ULTIMATE.start_create_#t~mem11#1.offset_33| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| .cse7 (store .cse9 |v_ULTIMATE.start_create_#t~mem9#1.offset_34| v_ArrVal_1506)))) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_33| (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (forall ((v_ArrVal_1512 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| .cse7 (store .cse8 |v_ULTIMATE.start_create_#t~mem9#1.offset_34| v_ArrVal_1507)))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (.cse6 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_33| 12))) (or (forall ((v_ArrVal_1510 Int)) (= (select (let ((.cse2 (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 v_ArrVal_1510)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3))) (+ (select (select (store .cse0 .cse5 v_ArrVal_1512) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3) 4)) 0)) (not (= (store (select .cse0 .cse5) .cse6 (select v_ArrVal_1512 .cse6)) v_ArrVal_1512))))))))) (< .cse10 |v_ULTIMATE.start_create_#t~mem9#1.offset_34|))) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_34| Int)) (or (< .cse10 |v_ULTIMATE.start_create_#t~mem9#1.offset_34|) (forall ((v_ArrVal_1507 Int) (v_ArrVal_1506 Int) (|v_ULTIMATE.start_create_#t~mem11#1.offset_33| Int)) (let ((.cse11 (store |c_#memory_$Pointer$#0.offset| .cse7 (store .cse9 |v_ULTIMATE.start_create_#t~mem9#1.offset_34| v_ArrVal_1506)))) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_33| (select (select .cse11 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (forall ((v_ArrVal_1512 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#0.base| .cse7 (store .cse8 |v_ULTIMATE.start_create_#t~mem9#1.offset_34| v_ArrVal_1507)))) (let ((.cse13 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_33| 12)) (.cse12 (select (select .cse15 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (or (not (= (store (select .cse11 .cse12) .cse13 (select v_ArrVal_1512 .cse13)) v_ArrVal_1512)) (forall ((v_ArrVal_1510 Int)) (= (let ((.cse14 (store .cse11 .cse12 v_ArrVal_1512))) (select (select .cse14 (select (select (store .cse15 .cse12 (store (select .cse15 .cse12) .cse13 v_ArrVal_1510)) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3)) (+ (select (select .cse14 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3) 4))) 0))))))))))))))) is different from false
[2024-11-22 18:53:02,753 WARN  L851   $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse9 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse6 |c_ULTIMATE.start_create_#t~ret8#1.offset|))) (.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse6 |c_ULTIMATE.start_create_#t~ret8#1.base|)))) (let ((.cse5 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse8 (select .cse7 |c_ULTIMATE.start_create_#t~ret8#1.base|)) (.cse10 (select .cse9 |c_ULTIMATE.start_create_#t~ret8#1.base|))) (and (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_34| Int)) (or (forall ((v_ArrVal_1507 Int) (v_ArrVal_1506 Int) (|v_ULTIMATE.start_create_#t~mem11#1.offset_33| Int)) (let ((.cse0 (store .cse9 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse10 |v_ULTIMATE.start_create_#t~mem9#1.offset_34| v_ArrVal_1506)))) (or (forall ((v_ArrVal_1512 (Array Int Int))) (let ((.cse4 (store .cse7 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse8 |v_ULTIMATE.start_create_#t~mem9#1.offset_34| v_ArrVal_1507)))) (let ((.cse2 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_33| 12)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (not (= v_ArrVal_1512 (store (select .cse0 .cse1) .cse2 (select v_ArrVal_1512 .cse2)))) (forall ((v_ArrVal_1510 Int)) (= (let ((.cse3 (store .cse0 .cse1 v_ArrVal_1512))) (select (select .cse3 (select (select (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 v_ArrVal_1510)) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse5)) (+ (select (select .cse3 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse5) 4))) 0)))))) (< |v_ULTIMATE.start_create_#t~mem11#1.offset_33| (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))))) (< |c_ULTIMATE.start_create_#t~ret8#1.offset| |v_ULTIMATE.start_create_#t~mem9#1.offset_34|))) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_34| Int)) (or (forall ((v_ArrVal_1507 Int) (v_ArrVal_1506 Int) (|v_ULTIMATE.start_create_#t~mem11#1.offset_33| Int)) (let ((.cse11 (store .cse9 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse10 |v_ULTIMATE.start_create_#t~mem9#1.offset_34| v_ArrVal_1506)))) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_33| (select (select .cse11 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (forall ((v_ArrVal_1512 (Array Int Int))) (let ((.cse13 (store .cse7 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse8 |v_ULTIMATE.start_create_#t~mem9#1.offset_34| v_ArrVal_1507)))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse15 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_33| 12))) (or (forall ((v_ArrVal_1510 Int)) (= (select (let ((.cse12 (store .cse13 .cse14 (store (select .cse13 .cse14) .cse15 v_ArrVal_1510)))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse5))) (+ (select (select (store .cse11 .cse14 v_ArrVal_1512) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse5) 4)) 0)) (not (= v_ArrVal_1512 (store (select .cse11 .cse14) .cse15 (select v_ArrVal_1512 .cse15))))))))))) (< |c_ULTIMATE.start_create_#t~ret8#1.offset| |v_ULTIMATE.start_create_#t~mem9#1.offset_34|))))))) is different from false
[2024-11-22 18:53:05,108 INFO  L349             Elim1Store]: treesize reduction 408, result has 30.4 percent of original size
[2024-11-22 18:53:05,110 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 20 new quantified variables, introduced 56 case distinctions, treesize of input 1059864 treesize of output 678869
[2024-11-22 18:53:10,952 INFO  L349             Elim1Store]: treesize reduction 1607, result has 25.6 percent of original size
[2024-11-22 18:53:10,955 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 12 new quantified variables, introduced 56 case distinctions, treesize of input 1723167 treesize of output 1485414
[2024-11-22 18:53:14,275 INFO  L224             Elim1Store]: Index analysis took 101 ms
[2024-11-22 18:53:15,300 INFO  L349             Elim1Store]: treesize reduction 1393, result has 25.4 percent of original size
[2024-11-22 18:53:15,301 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 11 new quantified variables, introduced 56 case distinctions, treesize of input 93764 treesize of output 90846
[2024-11-22 18:53:16,687 INFO  L224             Elim1Store]: Index analysis took 128 ms
[2024-11-22 18:53:18,157 INFO  L349             Elim1Store]: treesize reduction 257, result has 79.2 percent of original size
[2024-11-22 18:53:18,158 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 90504 treesize of output 90771
[2024-11-22 18:53:21,006 INFO  L349             Elim1Store]: treesize reduction 553, result has 28.6 percent of original size
[2024-11-22 18:53:21,008 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 16 new quantified variables, introduced 56 case distinctions, treesize of input 91581 treesize of output 66119
[2024-11-22 18:53:25,339 INFO  L349             Elim1Store]: treesize reduction 94, result has 80.3 percent of original size
[2024-11-22 18:53:25,341 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 16 new quantified variables, introduced 45 case distinctions, treesize of input 99048 treesize of output 73722