./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bff24c2-1d0b-4612-be12-829dbb06e57f/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bff24c2-1d0b-4612-be12-829dbb06e57f/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bff24c2-1d0b-4612-be12-829dbb06e57f/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bff24c2-1d0b-4612-be12-829dbb06e57f/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bff24c2-1d0b-4612-be12-829dbb06e57f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bff24c2-1d0b-4612-be12-829dbb06e57f/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e486f0f9d7d5faf0af2c33128bdcb8eeb95bb04afff03e23e86c60ceb8da8466 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:28:09,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:28:09,478 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bff24c2-1d0b-4612-be12-829dbb06e57f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:28:09,489 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:28:09,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:28:09,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:28:09,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:28:09,540 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:28:09,541 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:28:09,547 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:28:09,548 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:28:09,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:28:09,550 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:28:09,552 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:28:09,553 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:28:09,553 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:28:09,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:28:09,555 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:28:09,555 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:28:09,556 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:28:09,556 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:28:09,557 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:28:09,558 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:28:09,558 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:28:09,559 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:28:09,559 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:28:09,561 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:28:09,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:28:09,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:28:09,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:28:09,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:28:09,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:28:09,565 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:28:09,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:28:09,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:28:09,567 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:28:09,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:28:09,567 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:28:09,568 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bff24c2-1d0b-4612-be12-829dbb06e57f/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bff24c2-1d0b-4612-be12-829dbb06e57f/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e486f0f9d7d5faf0af2c33128bdcb8eeb95bb04afff03e23e86c60ceb8da8466 [2023-11-06 22:28:09,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:28:09,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:28:09,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:28:09,895 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:28:09,896 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:28:09,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bff24c2-1d0b-4612-be12-829dbb06e57f/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+nlh-reducer.c [2023-11-06 22:28:13,082 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:28:13,586 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:28:13,587 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bff24c2-1d0b-4612-be12-829dbb06e57f/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+nlh-reducer.c [2023-11-06 22:28:13,604 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bff24c2-1d0b-4612-be12-829dbb06e57f/bin/uautomizer-verify-WvqO1wxjHP/data/881aa077f/26ee3d00e5ce42278dbf432f6edf9807/FLAGb290fde1a [2023-11-06 22:28:13,624 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bff24c2-1d0b-4612-be12-829dbb06e57f/bin/uautomizer-verify-WvqO1wxjHP/data/881aa077f/26ee3d00e5ce42278dbf432f6edf9807 [2023-11-06 22:28:13,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:28:13,634 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:28:13,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:28:13,638 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:28:13,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:28:13,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:28:13" (1/1) ... [2023-11-06 22:28:13,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c8fa3e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:13, skipping insertion in model container [2023-11-06 22:28:13,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:28:13" (1/1) ... [2023-11-06 22:28:13,715 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:28:14,232 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:28:14,248 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:28:14,577 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:28:14,584 WARN L672 CHandler]: The function fopen is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:28:14,592 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:28:14,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:14 WrapperNode [2023-11-06 22:28:14,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:28:14,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:28:14,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:28:14,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:28:14,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:14" (1/1) ... [2023-11-06 22:28:14,649 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:14" (1/1) ... [2023-11-06 22:28:14,741 INFO L138 Inliner]: procedures = 17, calls = 621, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2244 [2023-11-06 22:28:14,741 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:28:14,742 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:28:14,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:28:14,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:28:14,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:14" (1/1) ... [2023-11-06 22:28:14,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:14" (1/1) ... [2023-11-06 22:28:14,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:14" (1/1) ... [2023-11-06 22:28:14,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:14" (1/1) ... [2023-11-06 22:28:14,895 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:14" (1/1) ... [2023-11-06 22:28:14,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:14" (1/1) ... [2023-11-06 22:28:14,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:14" (1/1) ... [2023-11-06 22:28:14,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:14" (1/1) ... [2023-11-06 22:28:14,934 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:28:14,935 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:28:14,935 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:28:14,935 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:28:14,936 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:14" (1/1) ... [2023-11-06 22:28:14,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:28:14,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bff24c2-1d0b-4612-be12-829dbb06e57f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:28:14,975 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bff24c2-1d0b-4612-be12-829dbb06e57f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:28:15,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bff24c2-1d0b-4612-be12-829dbb06e57f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:28:15,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:28:15,023 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2023-11-06 22:28:15,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:28:15,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:28:15,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:28:15,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:28:15,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:28:15,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:28:15,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:28:15,326 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:28:15,328 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:28:17,378 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:28:17,404 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:28:17,404 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:28:17,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:28:17 BoogieIcfgContainer [2023-11-06 22:28:17,410 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:28:17,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:28:17,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:28:17,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:28:17,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:28:13" (1/3) ... [2023-11-06 22:28:17,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21db84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:28:17, skipping insertion in model container [2023-11-06 22:28:17,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:14" (2/3) ... [2023-11-06 22:28:17,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21db84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:28:17, skipping insertion in model container [2023-11-06 22:28:17,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:28:17" (3/3) ... [2023-11-06 22:28:17,428 INFO L112 eAbstractionObserver]: Analyzing ICFG aiob_4.c.v+nlh-reducer.c [2023-11-06 22:28:17,486 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:28:17,490 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 168 error locations. [2023-11-06 22:28:17,564 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:28:17,573 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@398bcb20, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:28:17,573 INFO L358 AbstractCegarLoop]: Starting to check reachability of 168 error locations. [2023-11-06 22:28:17,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 471 states, 302 states have (on average 2.1258278145695364) internal successors, (642), 470 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:17,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-06 22:28:17,588 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:17,589 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-06 22:28:17,589 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr167ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:17,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:17,595 INFO L85 PathProgramCache]: Analyzing trace with hash 926756, now seen corresponding path program 1 times [2023-11-06 22:28:17,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:17,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936480863] [2023-11-06 22:28:17,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:17,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:18,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:18,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936480863] [2023-11-06 22:28:18,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936480863] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:18,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:18,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:28:18,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373208183] [2023-11-06 22:28:18,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:18,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:28:18,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:18,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:28:18,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:28:18,243 INFO L87 Difference]: Start difference. First operand has 471 states, 302 states have (on average 2.1258278145695364) internal successors, (642), 470 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:19,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:19,233 INFO L93 Difference]: Finished difference Result 471 states and 598 transitions. [2023-11-06 22:28:19,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:28:19,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-06 22:28:19,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:19,266 INFO L225 Difference]: With dead ends: 471 [2023-11-06 22:28:19,268 INFO L226 Difference]: Without dead ends: 468 [2023-11-06 22:28:19,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:28:19,277 INFO L413 NwaCegarLoop]: 511 mSDtfsCounter, 166 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:19,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1021 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:28:19,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2023-11-06 22:28:19,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2023-11-06 22:28:19,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 300 states have (on average 1.98) internal successors, (594), 467 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 594 transitions. [2023-11-06 22:28:19,380 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 594 transitions. Word has length 4 [2023-11-06 22:28:19,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:19,381 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 594 transitions. [2023-11-06 22:28:19,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:19,382 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 594 transitions. [2023-11-06 22:28:19,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-06 22:28:19,382 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:19,383 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-06 22:28:19,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:28:19,384 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:19,385 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:19,385 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2023-11-06 22:28:19,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:19,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35396229] [2023-11-06 22:28:19,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:19,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:19,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:19,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:19,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35396229] [2023-11-06 22:28:19,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35396229] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:19,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:19,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:28:19,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280696702] [2023-11-06 22:28:19,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:19,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:28:19,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:19,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:28:19,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:28:19,561 INFO L87 Difference]: Start difference. First operand 468 states and 594 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:20,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:20,407 INFO L93 Difference]: Finished difference Result 427 states and 553 transitions. [2023-11-06 22:28:20,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:28:20,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-06 22:28:20,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:20,410 INFO L225 Difference]: With dead ends: 427 [2023-11-06 22:28:20,411 INFO L226 Difference]: Without dead ends: 427 [2023-11-06 22:28:20,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:28:20,413 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 841 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:20,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 257 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:28:20,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2023-11-06 22:28:20,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2023-11-06 22:28:20,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 300 states have (on average 1.8433333333333333) internal successors, (553), 426 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:20,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 553 transitions. [2023-11-06 22:28:20,429 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 553 transitions. Word has length 4 [2023-11-06 22:28:20,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:20,429 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 553 transitions. [2023-11-06 22:28:20,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:20,430 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 553 transitions. [2023-11-06 22:28:20,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-06 22:28:20,430 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:20,431 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-06 22:28:20,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:28:20,431 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:20,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:20,432 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2023-11-06 22:28:20,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:20,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101430812] [2023-11-06 22:28:20,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:20,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:20,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:20,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101430812] [2023-11-06 22:28:20,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101430812] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:20,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:20,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:28:20,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472577209] [2023-11-06 22:28:20,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:20,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:28:20,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:20,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:28:20,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:28:20,606 INFO L87 Difference]: Start difference. First operand 427 states and 553 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:21,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:21,236 INFO L93 Difference]: Finished difference Result 386 states and 512 transitions. [2023-11-06 22:28:21,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:28:21,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-06 22:28:21,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:21,241 INFO L225 Difference]: With dead ends: 386 [2023-11-06 22:28:21,241 INFO L226 Difference]: Without dead ends: 386 [2023-11-06 22:28:21,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:28:21,243 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 888 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:21,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 258 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:28:21,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2023-11-06 22:28:21,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2023-11-06 22:28:21,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 300 states have (on average 1.7066666666666668) internal successors, (512), 385 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:21,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 512 transitions. [2023-11-06 22:28:21,266 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 512 transitions. Word has length 4 [2023-11-06 22:28:21,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:21,267 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 512 transitions. [2023-11-06 22:28:21,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:21,269 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 512 transitions. [2023-11-06 22:28:21,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-06 22:28:21,273 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:21,280 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:21,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:28:21,282 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr167ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:21,282 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:21,283 INFO L85 PathProgramCache]: Analyzing trace with hash 619918579, now seen corresponding path program 1 times [2023-11-06 22:28:21,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:21,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100193793] [2023-11-06 22:28:21,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:21,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:21,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:21,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:21,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100193793] [2023-11-06 22:28:21,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100193793] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:21,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:21,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:28:21,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10603333] [2023-11-06 22:28:21,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:21,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:28:21,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:21,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:28:21,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:28:21,786 INFO L87 Difference]: Start difference. First operand 386 states and 512 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:22,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:22,109 INFO L93 Difference]: Finished difference Result 388 states and 512 transitions. [2023-11-06 22:28:22,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:28:22,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2023-11-06 22:28:22,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:22,113 INFO L225 Difference]: With dead ends: 388 [2023-11-06 22:28:22,114 INFO L226 Difference]: Without dead ends: 388 [2023-11-06 22:28:22,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:28:22,116 INFO L413 NwaCegarLoop]: 509 mSDtfsCounter, 91 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:22,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 760 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:28:22,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2023-11-06 22:28:22,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 386. [2023-11-06 22:28:22,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 300 states have (on average 1.7033333333333334) internal successors, (511), 385 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:22,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 511 transitions. [2023-11-06 22:28:22,131 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 511 transitions. Word has length 88 [2023-11-06 22:28:22,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:22,132 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 511 transitions. [2023-11-06 22:28:22,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:22,133 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 511 transitions. [2023-11-06 22:28:22,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-06 22:28:22,138 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:22,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:22,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:28:22,139 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr167ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:22,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:22,140 INFO L85 PathProgramCache]: Analyzing trace with hash 2036638708, now seen corresponding path program 1 times [2023-11-06 22:28:22,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:22,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780731598] [2023-11-06 22:28:22,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:22,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:22,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:22,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:22,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780731598] [2023-11-06 22:28:22,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780731598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:22,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:22,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:28:22,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320734084] [2023-11-06 22:28:22,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:22,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:28:22,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:22,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:28:22,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:28:22,585 INFO L87 Difference]: Start difference. First operand 386 states and 511 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:22,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:22,599 INFO L93 Difference]: Finished difference Result 386 states and 510 transitions. [2023-11-06 22:28:22,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:28:22,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2023-11-06 22:28:22,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:22,602 INFO L225 Difference]: With dead ends: 386 [2023-11-06 22:28:22,602 INFO L226 Difference]: Without dead ends: 386 [2023-11-06 22:28:22,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:28:22,604 INFO L413 NwaCegarLoop]: 509 mSDtfsCounter, 423 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:22,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 594 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:28:22,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2023-11-06 22:28:22,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2023-11-06 22:28:22,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 300 states have (on average 1.7) internal successors, (510), 385 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:22,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 510 transitions. [2023-11-06 22:28:22,615 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 510 transitions. Word has length 89 [2023-11-06 22:28:22,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:22,616 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 510 transitions. [2023-11-06 22:28:22,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:22,616 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 510 transitions. [2023-11-06 22:28:22,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-06 22:28:22,617 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:22,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:22,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:28:22,618 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:22,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:22,619 INFO L85 PathProgramCache]: Analyzing trace with hash 2036637796, now seen corresponding path program 1 times [2023-11-06 22:28:22,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:22,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827789233] [2023-11-06 22:28:22,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:22,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:22,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:22,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827789233] [2023-11-06 22:28:22,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827789233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:22,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:22,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:28:22,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976993970] [2023-11-06 22:28:22,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:22,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:28:22,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:22,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:28:22,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:28:22,941 INFO L87 Difference]: Start difference. First operand 386 states and 510 transitions. Second operand has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:23,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:23,662 INFO L93 Difference]: Finished difference Result 385 states and 509 transitions. [2023-11-06 22:28:23,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:28:23,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2023-11-06 22:28:23,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:23,666 INFO L225 Difference]: With dead ends: 385 [2023-11-06 22:28:23,666 INFO L226 Difference]: Without dead ends: 385 [2023-11-06 22:28:23,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:28:23,668 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 589 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:23,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 341 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:28:23,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2023-11-06 22:28:23,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2023-11-06 22:28:23,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 300 states have (on average 1.6966666666666668) internal successors, (509), 384 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:23,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 509 transitions. [2023-11-06 22:28:23,686 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 509 transitions. Word has length 89 [2023-11-06 22:28:23,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:23,689 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 509 transitions. [2023-11-06 22:28:23,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:23,690 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 509 transitions. [2023-11-06 22:28:23,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-06 22:28:23,693 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:23,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:23,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:28:23,694 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:23,694 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:23,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2036637797, now seen corresponding path program 1 times [2023-11-06 22:28:23,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:23,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055557803] [2023-11-06 22:28:23,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:23,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:24,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:24,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:24,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055557803] [2023-11-06 22:28:24,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055557803] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:24,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:24,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:28:24,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739650170] [2023-11-06 22:28:24,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:24,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:28:24,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:24,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:28:24,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:28:24,507 INFO L87 Difference]: Start difference. First operand 385 states and 509 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:25,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:25,748 INFO L93 Difference]: Finished difference Result 384 states and 508 transitions. [2023-11-06 22:28:25,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:28:25,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2023-11-06 22:28:25,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:25,752 INFO L225 Difference]: With dead ends: 384 [2023-11-06 22:28:25,752 INFO L226 Difference]: Without dead ends: 384 [2023-11-06 22:28:25,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:28:25,758 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 882 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:25,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 426 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-06 22:28:25,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2023-11-06 22:28:25,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2023-11-06 22:28:25,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 300 states have (on average 1.6933333333333334) internal successors, (508), 383 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:25,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 508 transitions. [2023-11-06 22:28:25,771 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 508 transitions. Word has length 89 [2023-11-06 22:28:25,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:25,771 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 508 transitions. [2023-11-06 22:28:25,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:25,772 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 508 transitions. [2023-11-06 22:28:25,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-06 22:28:25,773 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:25,773 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:25,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:28:25,774 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr167ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:25,774 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:25,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1296129111, now seen corresponding path program 1 times [2023-11-06 22:28:25,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:25,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659060245] [2023-11-06 22:28:25,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:25,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:26,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:26,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:26,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659060245] [2023-11-06 22:28:26,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659060245] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:26,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:26,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:28:26,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851342220] [2023-11-06 22:28:26,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:26,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:28:26,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:26,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:28:26,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:28:26,851 INFO L87 Difference]: Start difference. First operand 384 states and 508 transitions. Second operand has 9 states, 8 states have (on average 11.375) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:28,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:28,363 INFO L93 Difference]: Finished difference Result 383 states and 507 transitions. [2023-11-06 22:28:28,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:28:28,364 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 11.375) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2023-11-06 22:28:28,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:28,366 INFO L225 Difference]: With dead ends: 383 [2023-11-06 22:28:28,366 INFO L226 Difference]: Without dead ends: 382 [2023-11-06 22:28:28,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:28:28,368 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 588 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:28,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 977 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1394 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-06 22:28:28,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2023-11-06 22:28:28,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2023-11-06 22:28:28,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 299 states have (on average 1.274247491638796) internal successors, (381), 381 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:28,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 381 transitions. [2023-11-06 22:28:28,379 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 381 transitions. Word has length 91 [2023-11-06 22:28:28,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:28,380 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 381 transitions. [2023-11-06 22:28:28,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 11.375) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:28,381 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 381 transitions. [2023-11-06 22:28:28,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-06 22:28:28,388 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:28,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:28,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:28:28,391 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:28,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:28,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2145244098, now seen corresponding path program 1 times [2023-11-06 22:28:28,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:28,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541334001] [2023-11-06 22:28:28,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:28,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:28,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:28,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541334001] [2023-11-06 22:28:28,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541334001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:28,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:28,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:28:28,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631070594] [2023-11-06 22:28:28,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:28,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:28:28,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:28,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:28:28,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:28:28,741 INFO L87 Difference]: Start difference. First operand 382 states and 381 transitions. Second operand has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:29,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:29,094 INFO L93 Difference]: Finished difference Result 381 states and 380 transitions. [2023-11-06 22:28:29,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:28:29,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2023-11-06 22:28:29,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:29,097 INFO L225 Difference]: With dead ends: 381 [2023-11-06 22:28:29,098 INFO L226 Difference]: Without dead ends: 381 [2023-11-06 22:28:29,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:28:29,099 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 870 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:29,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 426 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:28:29,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2023-11-06 22:28:29,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2023-11-06 22:28:29,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 299 states have (on average 1.2709030100334449) internal successors, (380), 380 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:29,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 380 transitions. [2023-11-06 22:28:29,111 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 380 transitions. Word has length 94 [2023-11-06 22:28:29,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:29,111 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 380 transitions. [2023-11-06 22:28:29,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:29,112 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 380 transitions. [2023-11-06 22:28:29,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-06 22:28:29,113 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:29,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:29,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:28:29,113 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:29,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:29,114 INFO L85 PathProgramCache]: Analyzing trace with hash -2145244097, now seen corresponding path program 1 times [2023-11-06 22:28:29,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:29,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351027783] [2023-11-06 22:28:29,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:29,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:29,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:29,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:29,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351027783] [2023-11-06 22:28:29,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351027783] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:29,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:29,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:28:29,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497823003] [2023-11-06 22:28:29,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:29,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:28:29,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:29,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:28:29,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:28:29,820 INFO L87 Difference]: Start difference. First operand 381 states and 380 transitions. Second operand has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:30,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:30,557 INFO L93 Difference]: Finished difference Result 380 states and 379 transitions. [2023-11-06 22:28:30,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:28:30,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2023-11-06 22:28:30,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:30,563 INFO L225 Difference]: With dead ends: 380 [2023-11-06 22:28:30,564 INFO L226 Difference]: Without dead ends: 380 [2023-11-06 22:28:30,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:28:30,565 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 740 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:30,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 424 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:28:30,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2023-11-06 22:28:30,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2023-11-06 22:28:30,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 299 states have (on average 1.2675585284280937) internal successors, (379), 379 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:30,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 379 transitions. [2023-11-06 22:28:30,578 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 379 transitions. Word has length 94 [2023-11-06 22:28:30,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:30,578 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 379 transitions. [2023-11-06 22:28:30,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:30,579 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 379 transitions. [2023-11-06 22:28:30,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-06 22:28:30,583 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:30,583 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:30,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:28:30,584 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:30,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:30,585 INFO L85 PathProgramCache]: Analyzing trace with hash -837057419, now seen corresponding path program 1 times [2023-11-06 22:28:30,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:30,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867728219] [2023-11-06 22:28:30,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:30,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:30,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:30,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:30,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867728219] [2023-11-06 22:28:30,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867728219] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:30,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:30,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:28:30,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570913887] [2023-11-06 22:28:30,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:30,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:28:30,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:30,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:28:30,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:28:30,932 INFO L87 Difference]: Start difference. First operand 380 states and 379 transitions. Second operand has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:31,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:31,284 INFO L93 Difference]: Finished difference Result 379 states and 378 transitions. [2023-11-06 22:28:31,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:28:31,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2023-11-06 22:28:31,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:31,289 INFO L225 Difference]: With dead ends: 379 [2023-11-06 22:28:31,289 INFO L226 Difference]: Without dead ends: 379 [2023-11-06 22:28:31,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:28:31,290 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 854 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:31,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 428 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:28:31,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2023-11-06 22:28:31,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2023-11-06 22:28:31,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 299 states have (on average 1.2642140468227425) internal successors, (378), 378 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:31,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 378 transitions. [2023-11-06 22:28:31,302 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 378 transitions. Word has length 99 [2023-11-06 22:28:31,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:31,303 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 378 transitions. [2023-11-06 22:28:31,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:31,304 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 378 transitions. [2023-11-06 22:28:31,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-06 22:28:31,305 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:31,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:31,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:28:31,307 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:31,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:31,308 INFO L85 PathProgramCache]: Analyzing trace with hash -837057418, now seen corresponding path program 1 times [2023-11-06 22:28:31,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:31,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270354905] [2023-11-06 22:28:31,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:31,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:32,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:32,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270354905] [2023-11-06 22:28:32,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270354905] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:32,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:32,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:28:32,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799142890] [2023-11-06 22:28:32,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:32,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:28:32,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:32,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:28:32,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:28:32,119 INFO L87 Difference]: Start difference. First operand 379 states and 378 transitions. Second operand has 7 states, 6 states have (on average 16.5) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:32,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:32,953 INFO L93 Difference]: Finished difference Result 378 states and 377 transitions. [2023-11-06 22:28:32,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:28:32,954 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.5) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2023-11-06 22:28:32,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:32,957 INFO L225 Difference]: With dead ends: 378 [2023-11-06 22:28:32,957 INFO L226 Difference]: Without dead ends: 378 [2023-11-06 22:28:32,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:28:32,958 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 727 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:32,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 511 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:28:32,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2023-11-06 22:28:32,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2023-11-06 22:28:32,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 299 states have (on average 1.2608695652173914) internal successors, (377), 377 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 377 transitions. [2023-11-06 22:28:32,970 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 377 transitions. Word has length 99 [2023-11-06 22:28:32,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:32,971 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 377 transitions. [2023-11-06 22:28:32,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.5) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:32,972 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 377 transitions. [2023-11-06 22:28:32,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-06 22:28:32,973 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:32,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:32,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:28:32,974 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:32,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:32,974 INFO L85 PathProgramCache]: Analyzing trace with hash -586464657, now seen corresponding path program 1 times [2023-11-06 22:28:32,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:32,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95367430] [2023-11-06 22:28:32,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:32,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:33,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:33,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:33,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95367430] [2023-11-06 22:28:33,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95367430] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:33,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:33,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:28:33,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679006853] [2023-11-06 22:28:33,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:33,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:28:33,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:33,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:28:33,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:28:33,347 INFO L87 Difference]: Start difference. First operand 378 states and 377 transitions. Second operand has 5 states, 4 states have (on average 26.0) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:33,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:33,694 INFO L93 Difference]: Finished difference Result 377 states and 376 transitions. [2023-11-06 22:28:33,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:28:33,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 26.0) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2023-11-06 22:28:33,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:33,697 INFO L225 Difference]: With dead ends: 377 [2023-11-06 22:28:33,697 INFO L226 Difference]: Without dead ends: 377 [2023-11-06 22:28:33,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:28:33,699 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 838 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:33,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 430 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:28:33,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2023-11-06 22:28:33,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2023-11-06 22:28:33,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 299 states have (on average 1.2575250836120402) internal successors, (376), 376 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:33,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 376 transitions. [2023-11-06 22:28:33,709 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 376 transitions. Word has length 104 [2023-11-06 22:28:33,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:33,709 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 376 transitions. [2023-11-06 22:28:33,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 26.0) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:33,710 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 376 transitions. [2023-11-06 22:28:33,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-06 22:28:33,711 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:33,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:33,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:28:33,712 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:33,712 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:33,712 INFO L85 PathProgramCache]: Analyzing trace with hash -586464656, now seen corresponding path program 1 times [2023-11-06 22:28:33,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:33,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860141302] [2023-11-06 22:28:33,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:33,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:34,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:34,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:34,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860141302] [2023-11-06 22:28:34,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860141302] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:34,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:34,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:28:34,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355443832] [2023-11-06 22:28:34,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:34,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:28:34,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:34,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:28:34,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:28:34,556 INFO L87 Difference]: Start difference. First operand 377 states and 376 transitions. Second operand has 6 states, 5 states have (on average 20.8) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:35,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:35,296 INFO L93 Difference]: Finished difference Result 376 states and 375 transitions. [2023-11-06 22:28:35,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:28:35,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.8) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2023-11-06 22:28:35,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:35,299 INFO L225 Difference]: With dead ends: 376 [2023-11-06 22:28:35,299 INFO L226 Difference]: Without dead ends: 376 [2023-11-06 22:28:35,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:28:35,300 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 990 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:35,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 431 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:28:35,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2023-11-06 22:28:35,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2023-11-06 22:28:35,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 299 states have (on average 1.254180602006689) internal successors, (375), 375 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:35,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 375 transitions. [2023-11-06 22:28:35,311 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 375 transitions. Word has length 104 [2023-11-06 22:28:35,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:35,312 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 375 transitions. [2023-11-06 22:28:35,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.8) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:35,312 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 375 transitions. [2023-11-06 22:28:35,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:28:35,313 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:35,314 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:35,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:28:35,314 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:35,315 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:35,315 INFO L85 PathProgramCache]: Analyzing trace with hash -84099962, now seen corresponding path program 1 times [2023-11-06 22:28:35,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:35,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110289192] [2023-11-06 22:28:35,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:35,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:35,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:35,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:35,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110289192] [2023-11-06 22:28:35,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110289192] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:35,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:35,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:28:35,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119937595] [2023-11-06 22:28:35,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:35,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:28:35,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:35,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:28:35,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:28:35,653 INFO L87 Difference]: Start difference. First operand 376 states and 375 transitions. Second operand has 5 states, 4 states have (on average 27.25) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:35,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:35,992 INFO L93 Difference]: Finished difference Result 375 states and 374 transitions. [2023-11-06 22:28:35,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:28:35,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.25) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2023-11-06 22:28:35,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:35,995 INFO L225 Difference]: With dead ends: 375 [2023-11-06 22:28:35,995 INFO L226 Difference]: Without dead ends: 375 [2023-11-06 22:28:35,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:28:35,996 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 822 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:35,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 432 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:28:35,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2023-11-06 22:28:36,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2023-11-06 22:28:36,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 299 states have (on average 1.2508361204013378) internal successors, (374), 374 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:36,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 374 transitions. [2023-11-06 22:28:36,007 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 374 transitions. Word has length 109 [2023-11-06 22:28:36,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:36,008 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 374 transitions. [2023-11-06 22:28:36,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.25) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:36,009 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 374 transitions. [2023-11-06 22:28:36,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:28:36,010 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:36,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:36,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:28:36,011 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:36,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:36,011 INFO L85 PathProgramCache]: Analyzing trace with hash -84099961, now seen corresponding path program 1 times [2023-11-06 22:28:36,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:36,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977131246] [2023-11-06 22:28:36,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:36,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:36,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:36,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:36,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977131246] [2023-11-06 22:28:36,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977131246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:36,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:36,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:28:36,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116382479] [2023-11-06 22:28:36,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:36,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:28:36,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:36,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:28:36,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:28:36,815 INFO L87 Difference]: Start difference. First operand 375 states and 374 transitions. Second operand has 6 states, 5 states have (on average 21.8) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:37,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:37,591 INFO L93 Difference]: Finished difference Result 374 states and 373 transitions. [2023-11-06 22:28:37,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:28:37,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.8) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2023-11-06 22:28:37,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:37,594 INFO L225 Difference]: With dead ends: 374 [2023-11-06 22:28:37,594 INFO L226 Difference]: Without dead ends: 374 [2023-11-06 22:28:37,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:28:37,595 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 705 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:37,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 474 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:28:37,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2023-11-06 22:28:37,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2023-11-06 22:28:37,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 299 states have (on average 1.2474916387959867) internal successors, (373), 373 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:37,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 373 transitions. [2023-11-06 22:28:37,605 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 373 transitions. Word has length 109 [2023-11-06 22:28:37,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:37,606 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 373 transitions. [2023-11-06 22:28:37,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.8) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:37,606 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 373 transitions. [2023-11-06 22:28:37,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-06 22:28:37,607 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:37,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:37,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:28:37,608 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:37,608 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:37,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1126073504, now seen corresponding path program 1 times [2023-11-06 22:28:37,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:37,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930065376] [2023-11-06 22:28:37,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:37,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:37,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:37,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:37,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930065376] [2023-11-06 22:28:37,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930065376] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:37,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:37,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:28:37,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611564781] [2023-11-06 22:28:37,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:37,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:28:37,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:37,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:28:37,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:28:37,925 INFO L87 Difference]: Start difference. First operand 374 states and 373 transitions. Second operand has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:38,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:38,249 INFO L93 Difference]: Finished difference Result 373 states and 372 transitions. [2023-11-06 22:28:38,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:28:38,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2023-11-06 22:28:38,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:38,252 INFO L225 Difference]: With dead ends: 373 [2023-11-06 22:28:38,252 INFO L226 Difference]: Without dead ends: 373 [2023-11-06 22:28:38,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:28:38,253 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 806 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:38,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 434 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:28:38,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2023-11-06 22:28:38,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2023-11-06 22:28:38,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 299 states have (on average 1.2441471571906355) internal successors, (372), 372 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:38,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 372 transitions. [2023-11-06 22:28:38,263 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 372 transitions. Word has length 114 [2023-11-06 22:28:38,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:38,263 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 372 transitions. [2023-11-06 22:28:38,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:38,264 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 372 transitions. [2023-11-06 22:28:38,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-06 22:28:38,265 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:38,265 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:38,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:28:38,265 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:38,266 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:38,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1126073505, now seen corresponding path program 1 times [2023-11-06 22:28:38,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:38,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576528155] [2023-11-06 22:28:38,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:38,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:39,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:39,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576528155] [2023-11-06 22:28:39,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576528155] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:39,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:39,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:28:39,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93438449] [2023-11-06 22:28:39,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:39,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:28:39,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:39,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:28:39,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:28:39,091 INFO L87 Difference]: Start difference. First operand 373 states and 372 transitions. Second operand has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:39,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:39,855 INFO L93 Difference]: Finished difference Result 372 states and 371 transitions. [2023-11-06 22:28:39,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:28:39,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2023-11-06 22:28:39,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:39,859 INFO L225 Difference]: With dead ends: 372 [2023-11-06 22:28:39,859 INFO L226 Difference]: Without dead ends: 372 [2023-11-06 22:28:39,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:28:39,860 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 694 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:39,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 476 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:28:39,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2023-11-06 22:28:39,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2023-11-06 22:28:39,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 299 states have (on average 1.2408026755852843) internal successors, (371), 371 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:39,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 371 transitions. [2023-11-06 22:28:39,871 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 371 transitions. Word has length 114 [2023-11-06 22:28:39,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:39,872 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 371 transitions. [2023-11-06 22:28:39,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:39,872 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 371 transitions. [2023-11-06 22:28:39,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 22:28:39,874 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:39,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:39,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:28:39,875 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:39,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:39,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1580157079, now seen corresponding path program 1 times [2023-11-06 22:28:39,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:39,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536765608] [2023-11-06 22:28:39,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:39,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:40,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:40,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:40,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536765608] [2023-11-06 22:28:40,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536765608] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:40,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:40,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:28:40,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255310719] [2023-11-06 22:28:40,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:40,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:28:40,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:40,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:28:40,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:28:40,198 INFO L87 Difference]: Start difference. First operand 372 states and 371 transitions. Second operand has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:40,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:40,552 INFO L93 Difference]: Finished difference Result 371 states and 370 transitions. [2023-11-06 22:28:40,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:28:40,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2023-11-06 22:28:40,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:40,555 INFO L225 Difference]: With dead ends: 371 [2023-11-06 22:28:40,556 INFO L226 Difference]: Without dead ends: 371 [2023-11-06 22:28:40,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:28:40,557 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 790 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:40,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 436 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:28:40,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2023-11-06 22:28:40,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2023-11-06 22:28:40,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 299 states have (on average 1.2374581939799332) internal successors, (370), 370 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:40,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 370 transitions. [2023-11-06 22:28:40,567 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 370 transitions. Word has length 119 [2023-11-06 22:28:40,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:40,567 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 370 transitions. [2023-11-06 22:28:40,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:40,568 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 370 transitions. [2023-11-06 22:28:40,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 22:28:40,569 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:40,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:40,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 22:28:40,570 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:40,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:40,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1580157080, now seen corresponding path program 1 times [2023-11-06 22:28:40,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:40,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882178201] [2023-11-06 22:28:40,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:40,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:41,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:41,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:41,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882178201] [2023-11-06 22:28:41,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882178201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:41,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:41,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:28:41,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432263306] [2023-11-06 22:28:41,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:41,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:28:41,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:41,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:28:41,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:28:41,284 INFO L87 Difference]: Start difference. First operand 371 states and 370 transitions. Second operand has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:42,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:42,016 INFO L93 Difference]: Finished difference Result 370 states and 369 transitions. [2023-11-06 22:28:42,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:28:42,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2023-11-06 22:28:42,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:42,020 INFO L225 Difference]: With dead ends: 370 [2023-11-06 22:28:42,020 INFO L226 Difference]: Without dead ends: 370 [2023-11-06 22:28:42,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:28:42,022 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 936 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:42,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 437 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:28:42,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2023-11-06 22:28:42,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2023-11-06 22:28:42,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 299 states have (on average 1.234113712374582) internal successors, (369), 369 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:42,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 369 transitions. [2023-11-06 22:28:42,040 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 369 transitions. Word has length 119 [2023-11-06 22:28:42,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:42,041 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 369 transitions. [2023-11-06 22:28:42,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:42,041 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 369 transitions. [2023-11-06 22:28:42,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 22:28:42,043 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:42,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:42,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 22:28:42,044 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:42,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:42,045 INFO L85 PathProgramCache]: Analyzing trace with hash 345305810, now seen corresponding path program 1 times [2023-11-06 22:28:42,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:42,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868321257] [2023-11-06 22:28:42,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:42,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:42,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:42,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:42,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868321257] [2023-11-06 22:28:42,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868321257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:42,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:42,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:28:42,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760497662] [2023-11-06 22:28:42,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:42,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:28:42,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:42,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:28:42,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:28:42,851 INFO L87 Difference]: Start difference. First operand 370 states and 369 transitions. Second operand has 6 states, 5 states have (on average 24.8) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:43,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:43,598 INFO L93 Difference]: Finished difference Result 369 states and 368 transitions. [2023-11-06 22:28:43,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:28:43,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 24.8) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2023-11-06 22:28:43,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:43,601 INFO L225 Difference]: With dead ends: 369 [2023-11-06 22:28:43,601 INFO L226 Difference]: Without dead ends: 369 [2023-11-06 22:28:43,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:28:43,602 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 675 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:43,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 480 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:28:43,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2023-11-06 22:28:43,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2023-11-06 22:28:43,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 299 states have (on average 1.2307692307692308) internal successors, (368), 368 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:43,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 368 transitions. [2023-11-06 22:28:43,613 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 368 transitions. Word has length 124 [2023-11-06 22:28:43,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:43,613 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 368 transitions. [2023-11-06 22:28:43,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 24.8) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:43,614 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 368 transitions. [2023-11-06 22:28:43,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 22:28:43,615 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:43,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:43,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 22:28:43,616 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:43,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:43,616 INFO L85 PathProgramCache]: Analyzing trace with hash 345305809, now seen corresponding path program 1 times [2023-11-06 22:28:43,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:43,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824545546] [2023-11-06 22:28:43,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:43,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:43,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:43,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824545546] [2023-11-06 22:28:43,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824545546] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:43,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:43,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:28:43,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817883392] [2023-11-06 22:28:43,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:43,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:28:43,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:43,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:28:43,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:28:43,917 INFO L87 Difference]: Start difference. First operand 369 states and 368 transitions. Second operand has 5 states, 4 states have (on average 31.0) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:44,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:44,277 INFO L93 Difference]: Finished difference Result 368 states and 367 transitions. [2023-11-06 22:28:44,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:28:44,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 31.0) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2023-11-06 22:28:44,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:44,281 INFO L225 Difference]: With dead ends: 368 [2023-11-06 22:28:44,281 INFO L226 Difference]: Without dead ends: 368 [2023-11-06 22:28:44,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:28:44,282 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 771 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:44,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 438 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:28:44,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2023-11-06 22:28:44,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2023-11-06 22:28:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 299 states have (on average 1.2274247491638797) internal successors, (367), 367 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:44,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 367 transitions. [2023-11-06 22:28:44,292 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 367 transitions. Word has length 124 [2023-11-06 22:28:44,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:44,293 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 367 transitions. [2023-11-06 22:28:44,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 31.0) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:44,294 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 367 transitions. [2023-11-06 22:28:44,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-06 22:28:44,295 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:44,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:44,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-06 22:28:44,296 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:44,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:44,296 INFO L85 PathProgramCache]: Analyzing trace with hash 286927016, now seen corresponding path program 1 times [2023-11-06 22:28:44,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:44,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572511136] [2023-11-06 22:28:44,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:44,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:44,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:44,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:44,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572511136] [2023-11-06 22:28:44,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572511136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:44,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:44,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:28:44,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494611139] [2023-11-06 22:28:44,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:44,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:28:44,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:44,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:28:44,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:28:44,619 INFO L87 Difference]: Start difference. First operand 368 states and 367 transitions. Second operand has 4 states, 3 states have (on average 43.0) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:44,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:44,917 INFO L93 Difference]: Finished difference Result 367 states and 366 transitions. [2023-11-06 22:28:44,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:28:44,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 43.0) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2023-11-06 22:28:44,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:44,921 INFO L225 Difference]: With dead ends: 367 [2023-11-06 22:28:44,921 INFO L226 Difference]: Without dead ends: 367 [2023-11-06 22:28:44,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:28:44,921 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 477 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:44,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 355 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:28:44,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2023-11-06 22:28:44,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2023-11-06 22:28:44,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 299 states have (on average 1.2240802675585285) internal successors, (366), 366 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:44,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 366 transitions. [2023-11-06 22:28:44,930 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 366 transitions. Word has length 129 [2023-11-06 22:28:44,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:44,931 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 366 transitions. [2023-11-06 22:28:44,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 43.0) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:44,931 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 366 transitions. [2023-11-06 22:28:44,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-06 22:28:44,933 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:44,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:44,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-06 22:28:44,933 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:44,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:44,934 INFO L85 PathProgramCache]: Analyzing trace with hash 286927017, now seen corresponding path program 1 times [2023-11-06 22:28:44,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:44,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830103821] [2023-11-06 22:28:44,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:44,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:45,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:45,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:45,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830103821] [2023-11-06 22:28:45,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830103821] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:45,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:45,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:28:45,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421979130] [2023-11-06 22:28:45,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:45,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:28:45,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:45,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:28:45,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:28:45,708 INFO L87 Difference]: Start difference. First operand 367 states and 366 transitions. Second operand has 7 states, 6 states have (on average 21.5) internal successors, (129), 7 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:46,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:46,470 INFO L93 Difference]: Finished difference Result 366 states and 365 transitions. [2023-11-06 22:28:46,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:28:46,471 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 21.5) internal successors, (129), 7 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2023-11-06 22:28:46,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:46,473 INFO L225 Difference]: With dead ends: 366 [2023-11-06 22:28:46,473 INFO L226 Difference]: Without dead ends: 366 [2023-11-06 22:28:46,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:28:46,474 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 661 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:46,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 482 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:28:46,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2023-11-06 22:28:46,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2023-11-06 22:28:46,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 299 states have (on average 1.2207357859531773) internal successors, (365), 365 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:46,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 365 transitions. [2023-11-06 22:28:46,484 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 365 transitions. Word has length 129 [2023-11-06 22:28:46,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:46,484 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 365 transitions. [2023-11-06 22:28:46,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 21.5) internal successors, (129), 7 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:46,484 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 365 transitions. [2023-11-06 22:28:46,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-06 22:28:46,486 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:46,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:46,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-06 22:28:46,487 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:46,487 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:46,487 INFO L85 PathProgramCache]: Analyzing trace with hash 6786306, now seen corresponding path program 1 times [2023-11-06 22:28:46,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:46,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443141572] [2023-11-06 22:28:46,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:46,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:46,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:46,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443141572] [2023-11-06 22:28:46,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443141572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:46,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:46,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:28:46,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337894683] [2023-11-06 22:28:46,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:46,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:28:46,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:46,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:28:46,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:28:46,888 INFO L87 Difference]: Start difference. First operand 366 states and 365 transitions. Second operand has 4 states, 3 states have (on average 44.666666666666664) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:47,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:47,249 INFO L93 Difference]: Finished difference Result 365 states and 364 transitions. [2023-11-06 22:28:47,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:28:47,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 44.666666666666664) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2023-11-06 22:28:47,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:47,252 INFO L225 Difference]: With dead ends: 365 [2023-11-06 22:28:47,252 INFO L226 Difference]: Without dead ends: 365 [2023-11-06 22:28:47,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:28:47,253 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 463 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:47,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 357 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:28:47,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2023-11-06 22:28:47,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2023-11-06 22:28:47,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 299 states have (on average 1.2173913043478262) internal successors, (364), 364 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:47,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 364 transitions. [2023-11-06 22:28:47,275 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 364 transitions. Word has length 134 [2023-11-06 22:28:47,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:47,276 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 364 transitions. [2023-11-06 22:28:47,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 44.666666666666664) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:47,277 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 364 transitions. [2023-11-06 22:28:47,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-06 22:28:47,279 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:47,279 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:47,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-06 22:28:47,279 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:47,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:47,280 INFO L85 PathProgramCache]: Analyzing trace with hash 6786307, now seen corresponding path program 1 times [2023-11-06 22:28:47,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:47,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971043710] [2023-11-06 22:28:47,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:47,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:48,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:48,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:48,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971043710] [2023-11-06 22:28:48,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971043710] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:48,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:48,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:28:48,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646127084] [2023-11-06 22:28:48,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:48,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:28:48,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:48,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:28:48,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:28:48,128 INFO L87 Difference]: Start difference. First operand 365 states and 364 transitions. Second operand has 6 states, 5 states have (on average 26.8) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:48,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:48,839 INFO L93 Difference]: Finished difference Result 364 states and 363 transitions. [2023-11-06 22:28:48,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:28:48,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 26.8) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2023-11-06 22:28:48,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:48,842 INFO L225 Difference]: With dead ends: 364 [2023-11-06 22:28:48,842 INFO L226 Difference]: Without dead ends: 364 [2023-11-06 22:28:48,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:28:48,843 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 882 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:48,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 443 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:28:48,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2023-11-06 22:28:48,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2023-11-06 22:28:48,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 299 states have (on average 1.214046822742475) internal successors, (363), 363 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:48,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 363 transitions. [2023-11-06 22:28:48,852 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 363 transitions. Word has length 134 [2023-11-06 22:28:48,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:48,853 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 363 transitions. [2023-11-06 22:28:48,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.8) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:48,853 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 363 transitions. [2023-11-06 22:28:48,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-06 22:28:48,855 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:48,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:48,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-06 22:28:48,855 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:48,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:48,856 INFO L85 PathProgramCache]: Analyzing trace with hash -664511303, now seen corresponding path program 1 times [2023-11-06 22:28:48,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:48,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962301258] [2023-11-06 22:28:48,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:48,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:49,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:49,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:49,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962301258] [2023-11-06 22:28:49,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962301258] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:49,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:49,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:28:49,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167309165] [2023-11-06 22:28:49,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:49,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:28:49,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:49,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:28:49,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:28:49,191 INFO L87 Difference]: Start difference. First operand 364 states and 363 transitions. Second operand has 4 states, 3 states have (on average 46.333333333333336) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:49,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:49,508 INFO L93 Difference]: Finished difference Result 363 states and 362 transitions. [2023-11-06 22:28:49,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:28:49,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 46.333333333333336) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2023-11-06 22:28:49,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:49,511 INFO L225 Difference]: With dead ends: 363 [2023-11-06 22:28:49,511 INFO L226 Difference]: Without dead ends: 363 [2023-11-06 22:28:49,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:28:49,513 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 449 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:49,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 359 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:28:49,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2023-11-06 22:28:49,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2023-11-06 22:28:49,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 299 states have (on average 1.2107023411371238) internal successors, (362), 362 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:49,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 362 transitions. [2023-11-06 22:28:49,522 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 362 transitions. Word has length 139 [2023-11-06 22:28:49,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:49,523 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 362 transitions. [2023-11-06 22:28:49,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 46.333333333333336) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:49,523 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 362 transitions. [2023-11-06 22:28:49,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-06 22:28:49,525 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:49,525 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:49,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-06 22:28:49,526 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:49,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:49,526 INFO L85 PathProgramCache]: Analyzing trace with hash -664511302, now seen corresponding path program 1 times [2023-11-06 22:28:49,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:49,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076975504] [2023-11-06 22:28:49,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:49,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:50,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:50,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:50,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076975504] [2023-11-06 22:28:50,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076975504] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:50,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:50,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:28:50,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670468721] [2023-11-06 22:28:50,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:50,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:28:50,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:50,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:28:50,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:28:50,402 INFO L87 Difference]: Start difference. First operand 363 states and 362 transitions. Second operand has 7 states, 6 states have (on average 23.166666666666668) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:51,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:51,137 INFO L93 Difference]: Finished difference Result 362 states and 361 transitions. [2023-11-06 22:28:51,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:28:51,138 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 23.166666666666668) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2023-11-06 22:28:51,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:51,140 INFO L225 Difference]: With dead ends: 362 [2023-11-06 22:28:51,140 INFO L226 Difference]: Without dead ends: 362 [2023-11-06 22:28:51,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:28:51,141 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 1132 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:51,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1132 Valid, 445 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:28:51,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2023-11-06 22:28:51,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2023-11-06 22:28:51,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 299 states have (on average 1.2073578595317727) internal successors, (361), 361 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:51,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 361 transitions. [2023-11-06 22:28:51,150 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 361 transitions. Word has length 139 [2023-11-06 22:28:51,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:51,151 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 361 transitions. [2023-11-06 22:28:51,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 23.166666666666668) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:51,152 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 361 transitions. [2023-11-06 22:28:51,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-06 22:28:51,153 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:51,153 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:51,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-06 22:28:51,154 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:51,154 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:51,155 INFO L85 PathProgramCache]: Analyzing trace with hash 307188531, now seen corresponding path program 1 times [2023-11-06 22:28:51,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:51,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264865109] [2023-11-06 22:28:51,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:51,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:51,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:51,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:51,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264865109] [2023-11-06 22:28:51,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264865109] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:51,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:51,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:28:51,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471137553] [2023-11-06 22:28:51,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:51,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:28:51,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:51,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:28:51,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:28:51,465 INFO L87 Difference]: Start difference. First operand 362 states and 361 transitions. Second operand has 4 states, 3 states have (on average 48.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:51,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:51,765 INFO L93 Difference]: Finished difference Result 361 states and 360 transitions. [2023-11-06 22:28:51,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:28:51,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 48.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2023-11-06 22:28:51,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:51,769 INFO L225 Difference]: With dead ends: 361 [2023-11-06 22:28:51,769 INFO L226 Difference]: Without dead ends: 361 [2023-11-06 22:28:51,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:28:51,770 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 435 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:51,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 361 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:28:51,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2023-11-06 22:28:51,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2023-11-06 22:28:51,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 299 states have (on average 1.2040133779264215) internal successors, (360), 360 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 360 transitions. [2023-11-06 22:28:51,779 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 360 transitions. Word has length 144 [2023-11-06 22:28:51,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:51,780 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 360 transitions. [2023-11-06 22:28:51,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 48.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:51,780 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 360 transitions. [2023-11-06 22:28:51,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-06 22:28:51,782 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:51,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:51,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-06 22:28:51,783 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:51,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:51,783 INFO L85 PathProgramCache]: Analyzing trace with hash 307188532, now seen corresponding path program 1 times [2023-11-06 22:28:51,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:51,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437532840] [2023-11-06 22:28:51,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:51,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:52,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:52,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437532840] [2023-11-06 22:28:52,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437532840] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:52,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:52,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:28:52,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809431891] [2023-11-06 22:28:52,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:52,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:28:52,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:52,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:28:52,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:28:52,625 INFO L87 Difference]: Start difference. First operand 361 states and 360 transitions. Second operand has 7 states, 6 states have (on average 24.0) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:53,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:53,333 INFO L93 Difference]: Finished difference Result 360 states and 359 transitions. [2023-11-06 22:28:53,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:28:53,334 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 24.0) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2023-11-06 22:28:53,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:53,337 INFO L225 Difference]: With dead ends: 360 [2023-11-06 22:28:53,337 INFO L226 Difference]: Without dead ends: 360 [2023-11-06 22:28:53,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:28:53,338 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 894 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:53,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 488 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:28:53,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2023-11-06 22:28:53,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2023-11-06 22:28:53,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 299 states have (on average 1.2006688963210703) internal successors, (359), 359 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:53,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 359 transitions. [2023-11-06 22:28:53,348 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 359 transitions. Word has length 144 [2023-11-06 22:28:53,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:53,348 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 359 transitions. [2023-11-06 22:28:53,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 24.0) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:53,349 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 359 transitions. [2023-11-06 22:28:53,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-06 22:28:53,350 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:53,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:53,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-06 22:28:53,351 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:53,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:53,352 INFO L85 PathProgramCache]: Analyzing trace with hash 334816458, now seen corresponding path program 1 times [2023-11-06 22:28:53,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:53,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060248096] [2023-11-06 22:28:53,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:53,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:53,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:53,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:53,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060248096] [2023-11-06 22:28:53,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060248096] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:53,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:53,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:28:53,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116368983] [2023-11-06 22:28:53,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:53,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:28:53,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:53,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:28:53,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:28:53,716 INFO L87 Difference]: Start difference. First operand 360 states and 359 transitions. Second operand has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:53,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:53,998 INFO L93 Difference]: Finished difference Result 359 states and 358 transitions. [2023-11-06 22:28:53,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:28:53,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2023-11-06 22:28:54,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:54,001 INFO L225 Difference]: With dead ends: 359 [2023-11-06 22:28:54,002 INFO L226 Difference]: Without dead ends: 359 [2023-11-06 22:28:54,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:28:54,002 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 421 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:54,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 363 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:28:54,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2023-11-06 22:28:54,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2023-11-06 22:28:54,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 299 states have (on average 1.1973244147157192) internal successors, (358), 358 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:54,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 358 transitions. [2023-11-06 22:28:54,012 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 358 transitions. Word has length 149 [2023-11-06 22:28:54,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:54,013 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 358 transitions. [2023-11-06 22:28:54,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:54,013 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 358 transitions. [2023-11-06 22:28:54,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-06 22:28:54,015 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:54,015 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:54,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-06 22:28:54,016 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:54,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:54,016 INFO L85 PathProgramCache]: Analyzing trace with hash 334816459, now seen corresponding path program 1 times [2023-11-06 22:28:54,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:54,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944316989] [2023-11-06 22:28:54,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:54,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:54,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:54,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:54,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944316989] [2023-11-06 22:28:54,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944316989] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:54,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:54,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:28:54,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064556180] [2023-11-06 22:28:54,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:54,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:28:54,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:54,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:28:54,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:28:54,822 INFO L87 Difference]: Start difference. First operand 359 states and 358 transitions. Second operand has 6 states, 5 states have (on average 29.8) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:55,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:55,476 INFO L93 Difference]: Finished difference Result 358 states and 357 transitions. [2023-11-06 22:28:55,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:28:55,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 29.8) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2023-11-06 22:28:55,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:55,479 INFO L225 Difference]: With dead ends: 358 [2023-11-06 22:28:55,479 INFO L226 Difference]: Without dead ends: 358 [2023-11-06 22:28:55,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:28:55,480 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 617 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:55,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 490 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:28:55,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2023-11-06 22:28:55,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2023-11-06 22:28:55,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 299 states have (on average 1.193979933110368) internal successors, (357), 357 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:55,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 357 transitions. [2023-11-06 22:28:55,488 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 357 transitions. Word has length 149 [2023-11-06 22:28:55,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:55,488 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 357 transitions. [2023-11-06 22:28:55,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 29.8) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:55,489 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 357 transitions. [2023-11-06 22:28:55,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-06 22:28:55,490 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:55,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:55,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-06 22:28:55,491 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:55,491 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:55,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1027259036, now seen corresponding path program 1 times [2023-11-06 22:28:55,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:55,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263226274] [2023-11-06 22:28:55,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:55,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:55,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:55,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:55,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263226274] [2023-11-06 22:28:55,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263226274] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:55,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:55,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:28:55,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404236633] [2023-11-06 22:28:55,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:55,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:28:55,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:55,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:28:55,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:28:55,805 INFO L87 Difference]: Start difference. First operand 358 states and 357 transitions. Second operand has 4 states, 3 states have (on average 51.333333333333336) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:56,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:56,058 INFO L93 Difference]: Finished difference Result 357 states and 356 transitions. [2023-11-06 22:28:56,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:28:56,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 51.333333333333336) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2023-11-06 22:28:56,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:56,061 INFO L225 Difference]: With dead ends: 357 [2023-11-06 22:28:56,061 INFO L226 Difference]: Without dead ends: 357 [2023-11-06 22:28:56,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:28:56,062 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 407 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:56,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 365 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:28:56,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2023-11-06 22:28:56,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2023-11-06 22:28:56,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 299 states have (on average 1.1906354515050168) internal successors, (356), 356 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:56,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 356 transitions. [2023-11-06 22:28:56,082 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 356 transitions. Word has length 154 [2023-11-06 22:28:56,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:56,084 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 356 transitions. [2023-11-06 22:28:56,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 51.333333333333336) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:56,084 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 356 transitions. [2023-11-06 22:28:56,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-06 22:28:56,086 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:56,087 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:56,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-06 22:28:56,087 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:56,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:56,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1027259035, now seen corresponding path program 1 times [2023-11-06 22:28:56,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:56,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123644713] [2023-11-06 22:28:56,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:56,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:56,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:56,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:56,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123644713] [2023-11-06 22:28:56,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123644713] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:56,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:56,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:28:56,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555226341] [2023-11-06 22:28:56,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:56,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:28:56,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:56,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:28:56,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:28:56,854 INFO L87 Difference]: Start difference. First operand 357 states and 356 transitions. Second operand has 6 states, 5 states have (on average 30.8) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:57,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:57,514 INFO L93 Difference]: Finished difference Result 356 states and 355 transitions. [2023-11-06 22:28:57,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:28:57,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 30.8) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2023-11-06 22:28:57,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:57,517 INFO L225 Difference]: With dead ends: 356 [2023-11-06 22:28:57,517 INFO L226 Difference]: Without dead ends: 356 [2023-11-06 22:28:57,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:28:57,518 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 606 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:57,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 492 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:28:57,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2023-11-06 22:28:57,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2023-11-06 22:28:57,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 299 states have (on average 1.1872909698996656) internal successors, (355), 355 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:57,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 355 transitions. [2023-11-06 22:28:57,528 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 355 transitions. Word has length 154 [2023-11-06 22:28:57,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:57,528 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 355 transitions. [2023-11-06 22:28:57,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 30.8) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:57,529 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 355 transitions. [2023-11-06 22:28:57,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-11-06 22:28:57,530 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:57,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:57,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-06 22:28:57,531 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:57,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:57,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1359822629, now seen corresponding path program 1 times [2023-11-06 22:28:57,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:57,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362655303] [2023-11-06 22:28:57,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:57,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:57,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:57,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:57,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362655303] [2023-11-06 22:28:57,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362655303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:57,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:57,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:28:57,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628439247] [2023-11-06 22:28:57,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:57,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:28:57,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:57,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:28:57,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:28:57,833 INFO L87 Difference]: Start difference. First operand 356 states and 355 transitions. Second operand has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:58,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:58,091 INFO L93 Difference]: Finished difference Result 355 states and 354 transitions. [2023-11-06 22:28:58,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:28:58,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2023-11-06 22:28:58,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:58,093 INFO L225 Difference]: With dead ends: 355 [2023-11-06 22:28:58,094 INFO L226 Difference]: Without dead ends: 355 [2023-11-06 22:28:58,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:28:58,094 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 393 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:58,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 367 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:28:58,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2023-11-06 22:28:58,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2023-11-06 22:28:58,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 299 states have (on average 1.1839464882943145) internal successors, (354), 354 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:58,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 354 transitions. [2023-11-06 22:28:58,102 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 354 transitions. Word has length 159 [2023-11-06 22:28:58,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:58,103 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 354 transitions. [2023-11-06 22:28:58,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:58,103 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 354 transitions. [2023-11-06 22:28:58,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-11-06 22:28:58,104 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:58,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:58,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-06 22:28:58,105 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr111REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:58,105 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:58,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1359822628, now seen corresponding path program 1 times [2023-11-06 22:28:58,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:58,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305071643] [2023-11-06 22:28:58,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:58,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:58,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:58,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:58,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305071643] [2023-11-06 22:28:58,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305071643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:58,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:58,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:28:58,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396999098] [2023-11-06 22:28:58,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:58,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:28:58,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:58,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:28:58,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:28:58,846 INFO L87 Difference]: Start difference. First operand 355 states and 354 transitions. Second operand has 7 states, 6 states have (on average 26.5) internal successors, (159), 7 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:59,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:59,367 INFO L93 Difference]: Finished difference Result 354 states and 353 transitions. [2023-11-06 22:28:59,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:28:59,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 26.5) internal successors, (159), 7 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2023-11-06 22:28:59,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:59,370 INFO L225 Difference]: With dead ends: 354 [2023-11-06 22:28:59,370 INFO L226 Difference]: Without dead ends: 354 [2023-11-06 22:28:59,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:28:59,371 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 1052 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:59,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 453 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:28:59,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2023-11-06 22:28:59,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2023-11-06 22:28:59,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 299 states have (on average 1.1806020066889633) internal successors, (353), 353 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:59,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 353 transitions. [2023-11-06 22:28:59,379 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 353 transitions. Word has length 159 [2023-11-06 22:28:59,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:59,380 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 353 transitions. [2023-11-06 22:28:59,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 26.5) internal successors, (159), 7 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:59,380 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 353 transitions. [2023-11-06 22:28:59,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-11-06 22:28:59,381 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:59,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:59,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-06 22:28:59,382 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr112REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:59,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:59,382 INFO L85 PathProgramCache]: Analyzing trace with hash 117597077, now seen corresponding path program 1 times [2023-11-06 22:28:59,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:59,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164573611] [2023-11-06 22:28:59,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:59,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:59,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:59,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:59,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164573611] [2023-11-06 22:28:59,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164573611] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:59,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:59,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:28:59,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250021885] [2023-11-06 22:28:59,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:59,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:28:59,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:59,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:28:59,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:28:59,673 INFO L87 Difference]: Start difference. First operand 354 states and 353 transitions. Second operand has 4 states, 3 states have (on average 54.666666666666664) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:59,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:59,923 INFO L93 Difference]: Finished difference Result 353 states and 352 transitions. [2023-11-06 22:28:59,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:28:59,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 54.666666666666664) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2023-11-06 22:28:59,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:59,926 INFO L225 Difference]: With dead ends: 353 [2023-11-06 22:28:59,926 INFO L226 Difference]: Without dead ends: 353 [2023-11-06 22:28:59,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:28:59,927 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 379 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:59,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 369 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:28:59,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2023-11-06 22:28:59,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2023-11-06 22:28:59,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 299 states have (on average 1.1772575250836121) internal successors, (352), 352 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:59,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 352 transitions. [2023-11-06 22:28:59,935 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 352 transitions. Word has length 164 [2023-11-06 22:28:59,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:59,936 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 352 transitions. [2023-11-06 22:28:59,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 54.666666666666664) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:59,936 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 352 transitions. [2023-11-06 22:28:59,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-11-06 22:28:59,937 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:59,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:59,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-11-06 22:28:59,937 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:28:59,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:59,938 INFO L85 PathProgramCache]: Analyzing trace with hash 117597078, now seen corresponding path program 1 times [2023-11-06 22:28:59,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:59,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189523363] [2023-11-06 22:28:59,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:59,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:00,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:00,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:00,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189523363] [2023-11-06 22:29:00,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189523363] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:00,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:00,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:29:00,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568255543] [2023-11-06 22:29:00,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:00,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:29:00,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:00,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:29:00,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:29:00,728 INFO L87 Difference]: Start difference. First operand 353 states and 352 transitions. Second operand has 6 states, 5 states have (on average 32.8) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:01,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:01,275 INFO L93 Difference]: Finished difference Result 352 states and 351 transitions. [2023-11-06 22:29:01,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:29:01,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 32.8) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2023-11-06 22:29:01,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:01,278 INFO L225 Difference]: With dead ends: 352 [2023-11-06 22:29:01,278 INFO L226 Difference]: Without dead ends: 352 [2023-11-06 22:29:01,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:29:01,279 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 584 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:01,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 496 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:29:01,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2023-11-06 22:29:01,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2023-11-06 22:29:01,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 299 states have (on average 1.173913043478261) internal successors, (351), 351 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:01,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 351 transitions. [2023-11-06 22:29:01,286 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 351 transitions. Word has length 164 [2023-11-06 22:29:01,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:01,287 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 351 transitions. [2023-11-06 22:29:01,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 32.8) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:01,287 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 351 transitions. [2023-11-06 22:29:01,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-11-06 22:29:01,288 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:01,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:01,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-11-06 22:29:01,289 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:01,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:01,290 INFO L85 PathProgramCache]: Analyzing trace with hash 264564972, now seen corresponding path program 1 times [2023-11-06 22:29:01,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:01,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12246811] [2023-11-06 22:29:01,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:01,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:01,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:01,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:01,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12246811] [2023-11-06 22:29:01,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12246811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:01,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:01,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:29:01,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9315705] [2023-11-06 22:29:01,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:01,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:01,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:01,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:01,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:29:01,552 INFO L87 Difference]: Start difference. First operand 352 states and 351 transitions. Second operand has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:01,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:01,804 INFO L93 Difference]: Finished difference Result 351 states and 350 transitions. [2023-11-06 22:29:01,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:01,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2023-11-06 22:29:01,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:01,806 INFO L225 Difference]: With dead ends: 351 [2023-11-06 22:29:01,806 INFO L226 Difference]: Without dead ends: 351 [2023-11-06 22:29:01,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:29:01,807 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 365 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:01,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 371 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:29:01,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2023-11-06 22:29:01,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2023-11-06 22:29:01,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 299 states have (on average 1.1705685618729098) internal successors, (350), 350 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:01,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 350 transitions. [2023-11-06 22:29:01,815 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 350 transitions. Word has length 169 [2023-11-06 22:29:01,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:01,815 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 350 transitions. [2023-11-06 22:29:01,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:01,816 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 350 transitions. [2023-11-06 22:29:01,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-11-06 22:29:01,817 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:01,817 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:01,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-11-06 22:29:01,817 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:01,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:01,818 INFO L85 PathProgramCache]: Analyzing trace with hash 264564973, now seen corresponding path program 1 times [2023-11-06 22:29:01,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:01,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745338032] [2023-11-06 22:29:01,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:01,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:02,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:02,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745338032] [2023-11-06 22:29:02,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745338032] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:02,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:02,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:29:02,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767737034] [2023-11-06 22:29:02,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:02,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:29:02,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:02,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:29:02,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:29:02,563 INFO L87 Difference]: Start difference. First operand 351 states and 350 transitions. Second operand has 6 states, 5 states have (on average 33.8) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:03,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:03,143 INFO L93 Difference]: Finished difference Result 350 states and 349 transitions. [2023-11-06 22:29:03,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:29:03,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 33.8) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2023-11-06 22:29:03,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:03,146 INFO L225 Difference]: With dead ends: 350 [2023-11-06 22:29:03,146 INFO L226 Difference]: Without dead ends: 350 [2023-11-06 22:29:03,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:29:03,147 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 756 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:03,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 457 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:29:03,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2023-11-06 22:29:03,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2023-11-06 22:29:03,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 299 states have (on average 1.1672240802675586) internal successors, (349), 349 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 349 transitions. [2023-11-06 22:29:03,155 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 349 transitions. Word has length 169 [2023-11-06 22:29:03,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:03,156 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 349 transitions. [2023-11-06 22:29:03,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 33.8) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:03,156 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 349 transitions. [2023-11-06 22:29:03,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-11-06 22:29:03,157 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:03,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:03,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-11-06 22:29:03,158 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:03,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:03,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1627368902, now seen corresponding path program 1 times [2023-11-06 22:29:03,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:03,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288027512] [2023-11-06 22:29:03,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:03,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:03,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:03,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:03,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288027512] [2023-11-06 22:29:03,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288027512] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:03,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:03,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:29:03,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147497297] [2023-11-06 22:29:03,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:03,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:03,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:03,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:03,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:29:03,461 INFO L87 Difference]: Start difference. First operand 350 states and 349 transitions. Second operand has 4 states, 3 states have (on average 58.0) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:03,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:03,691 INFO L93 Difference]: Finished difference Result 349 states and 348 transitions. [2023-11-06 22:29:03,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:03,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 58.0) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2023-11-06 22:29:03,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:03,694 INFO L225 Difference]: With dead ends: 349 [2023-11-06 22:29:03,694 INFO L226 Difference]: Without dead ends: 349 [2023-11-06 22:29:03,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:29:03,695 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 351 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:03,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 373 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:29:03,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2023-11-06 22:29:03,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2023-11-06 22:29:03,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 299 states have (on average 1.1638795986622072) internal successors, (348), 348 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:03,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 348 transitions. [2023-11-06 22:29:03,702 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 348 transitions. Word has length 174 [2023-11-06 22:29:03,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:03,702 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 348 transitions. [2023-11-06 22:29:03,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 58.0) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:03,703 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 348 transitions. [2023-11-06 22:29:03,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-11-06 22:29:03,704 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:03,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:03,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-11-06 22:29:03,705 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:03,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:03,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1627368903, now seen corresponding path program 1 times [2023-11-06 22:29:03,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:03,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445453282] [2023-11-06 22:29:03,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:03,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:04,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:04,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:04,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445453282] [2023-11-06 22:29:04,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445453282] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:04,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:04,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:29:04,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499707720] [2023-11-06 22:29:04,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:04,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:29:04,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:04,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:29:04,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:29:04,454 INFO L87 Difference]: Start difference. First operand 349 states and 348 transitions. Second operand has 6 states, 5 states have (on average 34.8) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:05,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:05,055 INFO L93 Difference]: Finished difference Result 348 states and 347 transitions. [2023-11-06 22:29:05,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:29:05,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 34.8) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2023-11-06 22:29:05,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:05,057 INFO L225 Difference]: With dead ends: 348 [2023-11-06 22:29:05,057 INFO L226 Difference]: Without dead ends: 348 [2023-11-06 22:29:05,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:29:05,058 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 562 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:05,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 500 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:29:05,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-11-06 22:29:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2023-11-06 22:29:05,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 299 states have (on average 1.160535117056856) internal successors, (347), 347 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:05,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 347 transitions. [2023-11-06 22:29:05,066 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 347 transitions. Word has length 174 [2023-11-06 22:29:05,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:05,066 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 347 transitions. [2023-11-06 22:29:05,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 34.8) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:05,067 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 347 transitions. [2023-11-06 22:29:05,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-11-06 22:29:05,068 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:05,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:05,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-11-06 22:29:05,068 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr118REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:05,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:05,069 INFO L85 PathProgramCache]: Analyzing trace with hash 135427325, now seen corresponding path program 1 times [2023-11-06 22:29:05,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:05,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408139004] [2023-11-06 22:29:05,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:05,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:05,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:05,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408139004] [2023-11-06 22:29:05,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408139004] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:05,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:05,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:29:05,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732927857] [2023-11-06 22:29:05,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:05,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:05,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:05,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:05,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:29:05,335 INFO L87 Difference]: Start difference. First operand 348 states and 347 transitions. Second operand has 4 states, 3 states have (on average 59.666666666666664) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:05,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:05,552 INFO L93 Difference]: Finished difference Result 347 states and 346 transitions. [2023-11-06 22:29:05,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:05,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 59.666666666666664) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2023-11-06 22:29:05,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:05,555 INFO L225 Difference]: With dead ends: 347 [2023-11-06 22:29:05,555 INFO L226 Difference]: Without dead ends: 347 [2023-11-06 22:29:05,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:29:05,556 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 337 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:05,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 375 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:29:05,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2023-11-06 22:29:05,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2023-11-06 22:29:05,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 299 states have (on average 1.157190635451505) internal successors, (346), 346 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:05,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 346 transitions. [2023-11-06 22:29:05,563 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 346 transitions. Word has length 179 [2023-11-06 22:29:05,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:05,563 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 346 transitions. [2023-11-06 22:29:05,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 59.666666666666664) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:05,564 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 346 transitions. [2023-11-06 22:29:05,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-11-06 22:29:05,565 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:05,565 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:05,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-11-06 22:29:05,565 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr119REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:05,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:05,566 INFO L85 PathProgramCache]: Analyzing trace with hash 135427326, now seen corresponding path program 1 times [2023-11-06 22:29:05,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:05,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774689871] [2023-11-06 22:29:05,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:05,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:06,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:06,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:06,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774689871] [2023-11-06 22:29:06,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774689871] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:06,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:06,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:29:06,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180674816] [2023-11-06 22:29:06,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:06,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:29:06,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:06,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:29:06,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:29:06,207 INFO L87 Difference]: Start difference. First operand 347 states and 346 transitions. Second operand has 7 states, 6 states have (on average 29.833333333333332) internal successors, (179), 7 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:06,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:06,743 INFO L93 Difference]: Finished difference Result 346 states and 345 transitions. [2023-11-06 22:29:06,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:29:06,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 29.833333333333332) internal successors, (179), 7 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2023-11-06 22:29:06,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:06,746 INFO L225 Difference]: With dead ends: 346 [2023-11-06 22:29:06,746 INFO L226 Difference]: Without dead ends: 346 [2023-11-06 22:29:06,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:29:06,747 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 720 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:06,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 461 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:29:06,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2023-11-06 22:29:06,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2023-11-06 22:29:06,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 299 states have (on average 1.1538461538461537) internal successors, (345), 345 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:06,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 345 transitions. [2023-11-06 22:29:06,754 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 345 transitions. Word has length 179 [2023-11-06 22:29:06,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:06,755 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 345 transitions. [2023-11-06 22:29:06,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 29.833333333333332) internal successors, (179), 7 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:06,755 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 345 transitions. [2023-11-06 22:29:06,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2023-11-06 22:29:06,756 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:06,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:06,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-11-06 22:29:06,757 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr120REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:06,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:06,757 INFO L85 PathProgramCache]: Analyzing trace with hash -277470217, now seen corresponding path program 1 times [2023-11-06 22:29:06,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:06,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828374675] [2023-11-06 22:29:06,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:06,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:07,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:07,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:07,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828374675] [2023-11-06 22:29:07,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828374675] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:07,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:07,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:29:07,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821377162] [2023-11-06 22:29:07,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:07,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:07,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:07,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:07,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:29:07,058 INFO L87 Difference]: Start difference. First operand 346 states and 345 transitions. Second operand has 4 states, 3 states have (on average 61.333333333333336) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:07,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:07,281 INFO L93 Difference]: Finished difference Result 345 states and 344 transitions. [2023-11-06 22:29:07,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:07,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 61.333333333333336) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2023-11-06 22:29:07,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:07,284 INFO L225 Difference]: With dead ends: 345 [2023-11-06 22:29:07,284 INFO L226 Difference]: Without dead ends: 345 [2023-11-06 22:29:07,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:29:07,285 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 323 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:07,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 377 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:29:07,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2023-11-06 22:29:07,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2023-11-06 22:29:07,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 299 states have (on average 1.1505016722408026) internal successors, (344), 344 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:07,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 344 transitions. [2023-11-06 22:29:07,292 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 344 transitions. Word has length 184 [2023-11-06 22:29:07,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:07,293 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 344 transitions. [2023-11-06 22:29:07,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 61.333333333333336) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:07,293 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 344 transitions. [2023-11-06 22:29:07,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2023-11-06 22:29:07,294 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:07,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:07,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-11-06 22:29:07,295 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr121REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:07,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:07,296 INFO L85 PathProgramCache]: Analyzing trace with hash -277470216, now seen corresponding path program 1 times [2023-11-06 22:29:07,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:07,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526196315] [2023-11-06 22:29:07,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:07,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:07,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:07,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:07,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526196315] [2023-11-06 22:29:07,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526196315] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:07,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:07,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:29:07,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797212533] [2023-11-06 22:29:07,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:07,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:29:07,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:07,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:29:07,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:29:07,958 INFO L87 Difference]: Start difference. First operand 345 states and 344 transitions. Second operand has 6 states, 5 states have (on average 36.8) internal successors, (184), 6 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:08,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:08,518 INFO L93 Difference]: Finished difference Result 344 states and 343 transitions. [2023-11-06 22:29:08,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:29:08,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 36.8) internal successors, (184), 6 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2023-11-06 22:29:08,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:08,523 INFO L225 Difference]: With dead ends: 344 [2023-11-06 22:29:08,524 INFO L226 Difference]: Without dead ends: 344 [2023-11-06 22:29:08,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:29:08,524 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 540 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:08,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 504 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:29:08,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2023-11-06 22:29:08,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2023-11-06 22:29:08,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 299 states have (on average 1.1471571906354514) internal successors, (343), 343 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:08,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 343 transitions. [2023-11-06 22:29:08,532 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 343 transitions. Word has length 184 [2023-11-06 22:29:08,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:08,532 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 343 transitions. [2023-11-06 22:29:08,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 36.8) internal successors, (184), 6 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:08,533 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 343 transitions. [2023-11-06 22:29:08,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2023-11-06 22:29:08,534 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:08,534 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:08,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-11-06 22:29:08,535 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr122REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:08,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:08,535 INFO L85 PathProgramCache]: Analyzing trace with hash -993899250, now seen corresponding path program 1 times [2023-11-06 22:29:08,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:08,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095070345] [2023-11-06 22:29:08,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:08,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:08,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:08,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:08,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095070345] [2023-11-06 22:29:08,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095070345] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:08,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:08,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:29:08,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101113257] [2023-11-06 22:29:08,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:08,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:08,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:08,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:08,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:29:08,833 INFO L87 Difference]: Start difference. First operand 344 states and 343 transitions. Second operand has 4 states, 3 states have (on average 63.0) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:09,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:09,079 INFO L93 Difference]: Finished difference Result 343 states and 342 transitions. [2023-11-06 22:29:09,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:09,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 63.0) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 189 [2023-11-06 22:29:09,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:09,081 INFO L225 Difference]: With dead ends: 343 [2023-11-06 22:29:09,082 INFO L226 Difference]: Without dead ends: 343 [2023-11-06 22:29:09,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:29:09,082 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 309 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:09,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 379 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:29:09,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2023-11-06 22:29:09,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2023-11-06 22:29:09,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 299 states have (on average 1.1438127090301002) internal successors, (342), 342 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:09,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 342 transitions. [2023-11-06 22:29:09,089 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 342 transitions. Word has length 189 [2023-11-06 22:29:09,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:09,090 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 342 transitions. [2023-11-06 22:29:09,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 63.0) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:09,090 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 342 transitions. [2023-11-06 22:29:09,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2023-11-06 22:29:09,091 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:09,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:09,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-11-06 22:29:09,092 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr123REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:09,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:09,092 INFO L85 PathProgramCache]: Analyzing trace with hash -993899249, now seen corresponding path program 1 times [2023-11-06 22:29:09,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:09,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611167611] [2023-11-06 22:29:09,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:09,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:09,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:09,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:09,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611167611] [2023-11-06 22:29:09,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611167611] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:09,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:09,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:29:09,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034011040] [2023-11-06 22:29:09,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:09,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:29:09,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:09,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:29:09,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:29:09,847 INFO L87 Difference]: Start difference. First operand 343 states and 342 transitions. Second operand has 7 states, 6 states have (on average 31.5) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:10,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:10,425 INFO L93 Difference]: Finished difference Result 342 states and 341 transitions. [2023-11-06 22:29:10,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:29:10,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 31.5) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 189 [2023-11-06 22:29:10,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:10,429 INFO L225 Difference]: With dead ends: 342 [2023-11-06 22:29:10,429 INFO L226 Difference]: Without dead ends: 342 [2023-11-06 22:29:10,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:29:10,430 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 529 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:10,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 547 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:29:10,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2023-11-06 22:29:10,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2023-11-06 22:29:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 299 states have (on average 1.140468227424749) internal successors, (341), 341 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:10,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 341 transitions. [2023-11-06 22:29:10,438 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 341 transitions. Word has length 189 [2023-11-06 22:29:10,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:10,439 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 341 transitions. [2023-11-06 22:29:10,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 31.5) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:10,439 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 341 transitions. [2023-11-06 22:29:10,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-11-06 22:29:10,442 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:10,442 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:10,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-11-06 22:29:10,443 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr124REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:10,443 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:10,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2111751720, now seen corresponding path program 1 times [2023-11-06 22:29:10,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:10,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343536281] [2023-11-06 22:29:10,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:10,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:10,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:10,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:10,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343536281] [2023-11-06 22:29:10,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343536281] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:10,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:10,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:29:10,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084127928] [2023-11-06 22:29:10,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:10,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:10,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:10,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:10,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:29:10,725 INFO L87 Difference]: Start difference. First operand 342 states and 341 transitions. Second operand has 4 states, 3 states have (on average 64.66666666666667) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:10,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:10,946 INFO L93 Difference]: Finished difference Result 341 states and 340 transitions. [2023-11-06 22:29:10,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:10,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 64.66666666666667) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2023-11-06 22:29:10,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:10,949 INFO L225 Difference]: With dead ends: 341 [2023-11-06 22:29:10,949 INFO L226 Difference]: Without dead ends: 341 [2023-11-06 22:29:10,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:29:10,950 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 295 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:10,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 381 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:29:10,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2023-11-06 22:29:10,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2023-11-06 22:29:10,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 299 states have (on average 1.137123745819398) internal successors, (340), 340 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:10,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 340 transitions. [2023-11-06 22:29:10,957 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 340 transitions. Word has length 194 [2023-11-06 22:29:10,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:10,957 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 340 transitions. [2023-11-06 22:29:10,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 64.66666666666667) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:10,958 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 340 transitions. [2023-11-06 22:29:10,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-11-06 22:29:10,959 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:10,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:10,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2023-11-06 22:29:10,960 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr125REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:10,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:10,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2111751721, now seen corresponding path program 1 times [2023-11-06 22:29:10,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:10,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697975448] [2023-11-06 22:29:10,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:10,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:11,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:11,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:11,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697975448] [2023-11-06 22:29:11,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697975448] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:11,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:11,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:29:11,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372049445] [2023-11-06 22:29:11,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:11,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:29:11,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:11,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:29:11,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:29:11,565 INFO L87 Difference]: Start difference. First operand 341 states and 340 transitions. Second operand has 7 states, 6 states have (on average 32.333333333333336) internal successors, (194), 7 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:12,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:12,127 INFO L93 Difference]: Finished difference Result 340 states and 339 transitions. [2023-11-06 22:29:12,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:29:12,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 32.333333333333336) internal successors, (194), 7 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2023-11-06 22:29:12,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:12,130 INFO L225 Difference]: With dead ends: 340 [2023-11-06 22:29:12,130 INFO L226 Difference]: Without dead ends: 340 [2023-11-06 22:29:12,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:29:12,131 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 764 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:12,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 508 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:29:12,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2023-11-06 22:29:12,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2023-11-06 22:29:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 299 states have (on average 1.1337792642140467) internal successors, (339), 339 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:12,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 339 transitions. [2023-11-06 22:29:12,138 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 339 transitions. Word has length 194 [2023-11-06 22:29:12,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:12,138 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 339 transitions. [2023-11-06 22:29:12,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 32.333333333333336) internal successors, (194), 7 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:12,139 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 339 transitions. [2023-11-06 22:29:12,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-11-06 22:29:12,140 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:12,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:12,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2023-11-06 22:29:12,140 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr126REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:12,141 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:12,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1107592929, now seen corresponding path program 1 times [2023-11-06 22:29:12,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:12,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929000793] [2023-11-06 22:29:12,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:12,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:12,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:12,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:12,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929000793] [2023-11-06 22:29:12,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929000793] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:12,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:12,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:29:12,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575241774] [2023-11-06 22:29:12,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:12,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:12,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:12,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:12,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:29:12,413 INFO L87 Difference]: Start difference. First operand 340 states and 339 transitions. Second operand has 4 states, 3 states have (on average 66.33333333333333) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:12,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:12,646 INFO L93 Difference]: Finished difference Result 339 states and 338 transitions. [2023-11-06 22:29:12,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:12,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 66.33333333333333) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2023-11-06 22:29:12,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:12,649 INFO L225 Difference]: With dead ends: 339 [2023-11-06 22:29:12,649 INFO L226 Difference]: Without dead ends: 339 [2023-11-06 22:29:12,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:29:12,650 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 281 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:12,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 383 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:29:12,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2023-11-06 22:29:12,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2023-11-06 22:29:12,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 299 states have (on average 1.1304347826086956) internal successors, (338), 338 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 338 transitions. [2023-11-06 22:29:12,656 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 338 transitions. Word has length 199 [2023-11-06 22:29:12,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:12,657 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 338 transitions. [2023-11-06 22:29:12,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 66.33333333333333) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:12,657 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 338 transitions. [2023-11-06 22:29:12,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-11-06 22:29:12,658 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:12,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:12,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2023-11-06 22:29:12,659 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr127REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:12,659 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:12,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1107592928, now seen corresponding path program 1 times [2023-11-06 22:29:12,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:12,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547442039] [2023-11-06 22:29:12,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:12,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:13,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:13,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:13,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547442039] [2023-11-06 22:29:13,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547442039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:13,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:13,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:29:13,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949351702] [2023-11-06 22:29:13,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:13,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:29:13,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:13,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:29:13,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:29:13,312 INFO L87 Difference]: Start difference. First operand 339 states and 338 transitions. Second operand has 7 states, 6 states have (on average 33.166666666666664) internal successors, (199), 7 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:13,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:13,865 INFO L93 Difference]: Finished difference Result 338 states and 337 transitions. [2023-11-06 22:29:13,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:29:13,866 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 33.166666666666664) internal successors, (199), 7 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2023-11-06 22:29:13,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:13,868 INFO L225 Difference]: With dead ends: 338 [2023-11-06 22:29:13,868 INFO L226 Difference]: Without dead ends: 338 [2023-11-06 22:29:13,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:29:13,869 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 751 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:13,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 510 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:29:13,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2023-11-06 22:29:13,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2023-11-06 22:29:13,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 299 states have (on average 1.1270903010033444) internal successors, (337), 337 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:13,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 337 transitions. [2023-11-06 22:29:13,876 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 337 transitions. Word has length 199 [2023-11-06 22:29:13,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:13,877 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 337 transitions. [2023-11-06 22:29:13,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 33.166666666666664) internal successors, (199), 7 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:13,878 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 337 transitions. [2023-11-06 22:29:13,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2023-11-06 22:29:13,879 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:13,879 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:13,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2023-11-06 22:29:13,880 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr129REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:13,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:13,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1804430246, now seen corresponding path program 1 times [2023-11-06 22:29:13,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:13,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148384282] [2023-11-06 22:29:13,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:13,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:14,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:14,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148384282] [2023-11-06 22:29:14,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148384282] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:14,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:14,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:29:14,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958858105] [2023-11-06 22:29:14,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:14,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:29:14,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:14,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:29:14,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:29:14,656 INFO L87 Difference]: Start difference. First operand 338 states and 337 transitions. Second operand has 7 states, 6 states have (on average 34.0) internal successors, (204), 7 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:15,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:15,175 INFO L93 Difference]: Finished difference Result 337 states and 336 transitions. [2023-11-06 22:29:15,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:29:15,175 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 34.0) internal successors, (204), 7 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2023-11-06 22:29:15,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:15,177 INFO L225 Difference]: With dead ends: 337 [2023-11-06 22:29:15,177 INFO L226 Difference]: Without dead ends: 337 [2023-11-06 22:29:15,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:29:15,178 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 742 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:15,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 512 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:29:15,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2023-11-06 22:29:15,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2023-11-06 22:29:15,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 299 states have (on average 1.1237458193979932) internal successors, (336), 336 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:15,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 336 transitions. [2023-11-06 22:29:15,184 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 336 transitions. Word has length 204 [2023-11-06 22:29:15,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:15,185 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 336 transitions. [2023-11-06 22:29:15,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 34.0) internal successors, (204), 7 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:15,185 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 336 transitions. [2023-11-06 22:29:15,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2023-11-06 22:29:15,186 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:15,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:15,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2023-11-06 22:29:15,187 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr128REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:15,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:15,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1804430247, now seen corresponding path program 1 times [2023-11-06 22:29:15,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:15,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310422951] [2023-11-06 22:29:15,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:15,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:15,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:15,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:15,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310422951] [2023-11-06 22:29:15,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310422951] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:15,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:15,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:29:15,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698069649] [2023-11-06 22:29:15,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:15,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:15,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:15,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:15,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:29:15,477 INFO L87 Difference]: Start difference. First operand 337 states and 336 transitions. Second operand has 4 states, 3 states have (on average 68.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:15,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:15,695 INFO L93 Difference]: Finished difference Result 336 states and 335 transitions. [2023-11-06 22:29:15,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:15,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 68.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2023-11-06 22:29:15,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:15,698 INFO L225 Difference]: With dead ends: 336 [2023-11-06 22:29:15,698 INFO L226 Difference]: Without dead ends: 336 [2023-11-06 22:29:15,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:29:15,699 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 265 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:15,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 385 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:29:15,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2023-11-06 22:29:15,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2023-11-06 22:29:15,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 299 states have (on average 1.120401337792642) internal successors, (335), 335 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:15,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 335 transitions. [2023-11-06 22:29:15,705 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 335 transitions. Word has length 204 [2023-11-06 22:29:15,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:15,705 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 335 transitions. [2023-11-06 22:29:15,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 68.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:15,706 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 335 transitions. [2023-11-06 22:29:15,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-11-06 22:29:15,707 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:15,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:15,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2023-11-06 22:29:15,708 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr130REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:15,708 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:15,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1490749136, now seen corresponding path program 1 times [2023-11-06 22:29:15,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:15,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029222986] [2023-11-06 22:29:15,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:15,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:15,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:15,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029222986] [2023-11-06 22:29:15,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029222986] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:15,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:15,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:29:15,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242429220] [2023-11-06 22:29:15,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:15,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:15,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:15,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:15,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:29:15,999 INFO L87 Difference]: Start difference. First operand 336 states and 335 transitions. Second operand has 4 states, 3 states have (on average 69.66666666666667) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:16,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:16,215 INFO L93 Difference]: Finished difference Result 335 states and 334 transitions. [2023-11-06 22:29:16,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:16,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 69.66666666666667) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 209 [2023-11-06 22:29:16,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:16,217 INFO L225 Difference]: With dead ends: 335 [2023-11-06 22:29:16,217 INFO L226 Difference]: Without dead ends: 335 [2023-11-06 22:29:16,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:29:16,218 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 253 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:16,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 387 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:29:16,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2023-11-06 22:29:16,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2023-11-06 22:29:16,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 299 states have (on average 1.117056856187291) internal successors, (334), 334 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:16,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 334 transitions. [2023-11-06 22:29:16,224 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 334 transitions. Word has length 209 [2023-11-06 22:29:16,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:16,225 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 334 transitions. [2023-11-06 22:29:16,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 69.66666666666667) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:16,225 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 334 transitions. [2023-11-06 22:29:16,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-11-06 22:29:16,226 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:16,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:16,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2023-11-06 22:29:16,227 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr131REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:16,227 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:16,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1490749135, now seen corresponding path program 1 times [2023-11-06 22:29:16,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:16,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611811706] [2023-11-06 22:29:16,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:16,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:16,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:16,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:16,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611811706] [2023-11-06 22:29:16,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611811706] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:16,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:16,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:29:16,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658595499] [2023-11-06 22:29:16,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:16,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:29:16,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:16,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:29:16,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:29:16,942 INFO L87 Difference]: Start difference. First operand 335 states and 334 transitions. Second operand has 6 states, 5 states have (on average 41.8) internal successors, (209), 6 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:17,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:17,459 INFO L93 Difference]: Finished difference Result 334 states and 333 transitions. [2023-11-06 22:29:17,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:29:17,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 41.8) internal successors, (209), 6 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 209 [2023-11-06 22:29:17,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:17,461 INFO L225 Difference]: With dead ends: 334 [2023-11-06 22:29:17,461 INFO L226 Difference]: Without dead ends: 334 [2023-11-06 22:29:17,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:29:17,462 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 612 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:17,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 473 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:29:17,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2023-11-06 22:29:17,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2023-11-06 22:29:17,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 299 states have (on average 1.1137123745819397) internal successors, (333), 333 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:17,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 333 transitions. [2023-11-06 22:29:17,468 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 333 transitions. Word has length 209 [2023-11-06 22:29:17,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:17,469 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 333 transitions. [2023-11-06 22:29:17,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 41.8) internal successors, (209), 6 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:17,469 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 333 transitions. [2023-11-06 22:29:17,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2023-11-06 22:29:17,470 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:17,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:17,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2023-11-06 22:29:17,471 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr132REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:17,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:17,471 INFO L85 PathProgramCache]: Analyzing trace with hash -2010476918, now seen corresponding path program 1 times [2023-11-06 22:29:17,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:17,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848885336] [2023-11-06 22:29:17,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:17,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:17,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:17,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:17,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848885336] [2023-11-06 22:29:17,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848885336] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:17,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:17,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:29:17,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536481332] [2023-11-06 22:29:17,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:17,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:17,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:17,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:17,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:29:17,798 INFO L87 Difference]: Start difference. First operand 334 states and 333 transitions. Second operand has 4 states, 3 states have (on average 71.33333333333333) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:18,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:18,039 INFO L93 Difference]: Finished difference Result 333 states and 332 transitions. [2023-11-06 22:29:18,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:18,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 71.33333333333333) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 214 [2023-11-06 22:29:18,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:18,042 INFO L225 Difference]: With dead ends: 333 [2023-11-06 22:29:18,042 INFO L226 Difference]: Without dead ends: 333 [2023-11-06 22:29:18,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:29:18,043 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 239 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:18,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 389 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:29:18,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2023-11-06 22:29:18,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2023-11-06 22:29:18,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 299 states have (on average 1.1103678929765886) internal successors, (332), 332 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:18,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 332 transitions. [2023-11-06 22:29:18,048 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 332 transitions. Word has length 214 [2023-11-06 22:29:18,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:18,049 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 332 transitions. [2023-11-06 22:29:18,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 71.33333333333333) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:18,050 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 332 transitions. [2023-11-06 22:29:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2023-11-06 22:29:18,056 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:18,056 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:18,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2023-11-06 22:29:18,057 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr133REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:18,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:18,057 INFO L85 PathProgramCache]: Analyzing trace with hash -2010476917, now seen corresponding path program 1 times [2023-11-06 22:29:18,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:18,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003312506] [2023-11-06 22:29:18,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:18,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:18,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:18,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003312506] [2023-11-06 22:29:18,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003312506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:18,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:18,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:29:18,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833080775] [2023-11-06 22:29:18,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:18,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:29:18,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:18,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:29:18,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:29:18,817 INFO L87 Difference]: Start difference. First operand 333 states and 332 transitions. Second operand has 6 states, 5 states have (on average 42.8) internal successors, (214), 6 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:19,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:19,327 INFO L93 Difference]: Finished difference Result 332 states and 331 transitions. [2023-11-06 22:29:19,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:29:19,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 42.8) internal successors, (214), 6 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 214 [2023-11-06 22:29:19,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:19,329 INFO L225 Difference]: With dead ends: 332 [2023-11-06 22:29:19,329 INFO L226 Difference]: Without dead ends: 332 [2023-11-06 22:29:19,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:29:19,330 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 594 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:19,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 475 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:29:19,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2023-11-06 22:29:19,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2023-11-06 22:29:19,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 299 states have (on average 1.1070234113712374) internal successors, (331), 331 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:19,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 331 transitions. [2023-11-06 22:29:19,336 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 331 transitions. Word has length 214 [2023-11-06 22:29:19,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:19,337 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 331 transitions. [2023-11-06 22:29:19,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 42.8) internal successors, (214), 6 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:19,337 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 331 transitions. [2023-11-06 22:29:19,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2023-11-06 22:29:19,338 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:19,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:19,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2023-11-06 22:29:19,339 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr134REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:19,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:19,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1592118593, now seen corresponding path program 1 times [2023-11-06 22:29:19,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:19,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162442283] [2023-11-06 22:29:19,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:19,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:19,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:19,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:19,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162442283] [2023-11-06 22:29:19,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162442283] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:19,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:19,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:29:19,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104975907] [2023-11-06 22:29:19,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:19,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:19,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:19,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:19,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:29:19,612 INFO L87 Difference]: Start difference. First operand 332 states and 331 transitions. Second operand has 4 states, 3 states have (on average 73.0) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:19,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:19,830 INFO L93 Difference]: Finished difference Result 331 states and 330 transitions. [2023-11-06 22:29:19,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:19,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 73.0) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 219 [2023-11-06 22:29:19,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:19,833 INFO L225 Difference]: With dead ends: 331 [2023-11-06 22:29:19,833 INFO L226 Difference]: Without dead ends: 331 [2023-11-06 22:29:19,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:29:19,833 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 225 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:19,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 391 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:29:19,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2023-11-06 22:29:19,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2023-11-06 22:29:19,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 299 states have (on average 1.1036789297658862) internal successors, (330), 330 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:19,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 330 transitions. [2023-11-06 22:29:19,838 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 330 transitions. Word has length 219 [2023-11-06 22:29:19,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:19,839 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 330 transitions. [2023-11-06 22:29:19,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 73.0) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:19,839 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 330 transitions. [2023-11-06 22:29:19,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2023-11-06 22:29:19,841 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:19,841 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:19,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2023-11-06 22:29:19,841 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr135REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:19,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:19,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1592118594, now seen corresponding path program 1 times [2023-11-06 22:29:19,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:19,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538623618] [2023-11-06 22:29:19,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:19,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:20,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:20,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:20,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538623618] [2023-11-06 22:29:20,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538623618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:20,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:20,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:29:20,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691692883] [2023-11-06 22:29:20,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:20,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:29:20,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:20,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:29:20,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:29:20,573 INFO L87 Difference]: Start difference. First operand 331 states and 330 transitions. Second operand has 7 states, 6 states have (on average 36.5) internal successors, (219), 7 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:21,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:21,092 INFO L93 Difference]: Finished difference Result 330 states and 329 transitions. [2023-11-06 22:29:21,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:29:21,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 36.5) internal successors, (219), 7 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 219 [2023-11-06 22:29:21,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:21,095 INFO L225 Difference]: With dead ends: 330 [2023-11-06 22:29:21,095 INFO L226 Difference]: Without dead ends: 330 [2023-11-06 22:29:21,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:29:21,096 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 812 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:21,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 477 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:29:21,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2023-11-06 22:29:21,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2023-11-06 22:29:21,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 299 states have (on average 1.100334448160535) internal successors, (329), 329 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 329 transitions. [2023-11-06 22:29:21,102 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 329 transitions. Word has length 219 [2023-11-06 22:29:21,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:21,102 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 329 transitions. [2023-11-06 22:29:21,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 36.5) internal successors, (219), 7 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:21,103 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 329 transitions. [2023-11-06 22:29:21,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2023-11-06 22:29:21,104 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:21,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:21,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2023-11-06 22:29:21,105 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr136REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:21,105 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:21,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1967147845, now seen corresponding path program 1 times [2023-11-06 22:29:21,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:21,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197920104] [2023-11-06 22:29:21,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:21,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:21,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:21,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:21,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197920104] [2023-11-06 22:29:21,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197920104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:21,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:21,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:29:21,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928456689] [2023-11-06 22:29:21,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:21,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:21,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:21,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:21,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:29:21,401 INFO L87 Difference]: Start difference. First operand 330 states and 329 transitions. Second operand has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:21,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:21,619 INFO L93 Difference]: Finished difference Result 329 states and 328 transitions. [2023-11-06 22:29:21,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:21,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 224 [2023-11-06 22:29:21,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:21,621 INFO L225 Difference]: With dead ends: 329 [2023-11-06 22:29:21,621 INFO L226 Difference]: Without dead ends: 329 [2023-11-06 22:29:21,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:29:21,622 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 211 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:21,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 393 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:29:21,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2023-11-06 22:29:21,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2023-11-06 22:29:21,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 299 states have (on average 1.0969899665551839) internal successors, (328), 328 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:21,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 328 transitions. [2023-11-06 22:29:21,628 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 328 transitions. Word has length 224 [2023-11-06 22:29:21,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:21,628 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 328 transitions. [2023-11-06 22:29:21,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:21,629 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 328 transitions. [2023-11-06 22:29:21,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2023-11-06 22:29:21,630 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:21,630 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:21,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2023-11-06 22:29:21,631 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:21,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:21,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1967147844, now seen corresponding path program 1 times [2023-11-06 22:29:21,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:21,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423707504] [2023-11-06 22:29:21,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:21,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:22,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:22,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:22,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423707504] [2023-11-06 22:29:22,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423707504] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:22,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:22,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:29:22,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146586016] [2023-11-06 22:29:22,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:22,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:29:22,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:22,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:29:22,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:29:22,310 INFO L87 Difference]: Start difference. First operand 329 states and 328 transitions. Second operand has 7 states, 6 states have (on average 37.333333333333336) internal successors, (224), 7 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:22,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:22,810 INFO L93 Difference]: Finished difference Result 328 states and 327 transitions. [2023-11-06 22:29:22,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:29:22,810 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 37.333333333333336) internal successors, (224), 7 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 224 [2023-11-06 22:29:22,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:22,812 INFO L225 Difference]: With dead ends: 328 [2023-11-06 22:29:22,812 INFO L226 Difference]: Without dead ends: 328 [2023-11-06 22:29:22,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:29:22,813 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 792 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:22,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 479 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:29:22,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2023-11-06 22:29:22,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2023-11-06 22:29:22,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 299 states have (on average 1.0936454849498327) internal successors, (327), 327 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:22,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 327 transitions. [2023-11-06 22:29:22,818 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 327 transitions. Word has length 224 [2023-11-06 22:29:22,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:22,818 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 327 transitions. [2023-11-06 22:29:22,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 37.333333333333336) internal successors, (224), 7 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:22,818 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 327 transitions. [2023-11-06 22:29:22,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-11-06 22:29:22,819 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:22,820 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:22,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2023-11-06 22:29:22,820 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr138REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:22,820 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:22,821 INFO L85 PathProgramCache]: Analyzing trace with hash -551226030, now seen corresponding path program 1 times [2023-11-06 22:29:22,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:22,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63310625] [2023-11-06 22:29:22,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:22,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:23,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:23,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:23,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63310625] [2023-11-06 22:29:23,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63310625] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:23,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:23,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:29:23,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5194328] [2023-11-06 22:29:23,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:23,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:23,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:23,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:23,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:29:23,103 INFO L87 Difference]: Start difference. First operand 328 states and 327 transitions. Second operand has 4 states, 3 states have (on average 76.33333333333333) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:23,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:23,319 INFO L93 Difference]: Finished difference Result 327 states and 326 transitions. [2023-11-06 22:29:23,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:23,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 76.33333333333333) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229 [2023-11-06 22:29:23,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:23,321 INFO L225 Difference]: With dead ends: 327 [2023-11-06 22:29:23,321 INFO L226 Difference]: Without dead ends: 327 [2023-11-06 22:29:23,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:29:23,321 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 197 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:23,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 395 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:29:23,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-11-06 22:29:23,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2023-11-06 22:29:23,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 299 states have (on average 1.0903010033444815) internal successors, (326), 326 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:23,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 326 transitions. [2023-11-06 22:29:23,326 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 326 transitions. Word has length 229 [2023-11-06 22:29:23,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:23,327 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 326 transitions. [2023-11-06 22:29:23,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 76.33333333333333) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:23,327 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 326 transitions. [2023-11-06 22:29:23,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-11-06 22:29:23,329 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:23,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:23,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2023-11-06 22:29:23,329 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr139REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:23,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:23,330 INFO L85 PathProgramCache]: Analyzing trace with hash -551226029, now seen corresponding path program 1 times [2023-11-06 22:29:23,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:23,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091814730] [2023-11-06 22:29:23,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:23,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:24,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:24,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:24,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091814730] [2023-11-06 22:29:24,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091814730] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:24,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:24,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:29:24,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553192849] [2023-11-06 22:29:24,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:24,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:29:24,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:24,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:29:24,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:29:24,170 INFO L87 Difference]: Start difference. First operand 327 states and 326 transitions. Second operand has 6 states, 5 states have (on average 45.8) internal successors, (229), 6 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:24,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:24,687 INFO L93 Difference]: Finished difference Result 326 states and 325 transitions. [2023-11-06 22:29:24,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:29:24,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 45.8) internal successors, (229), 6 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229 [2023-11-06 22:29:24,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:24,690 INFO L225 Difference]: With dead ends: 326 [2023-11-06 22:29:24,690 INFO L226 Difference]: Without dead ends: 326 [2023-11-06 22:29:24,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:29:24,691 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 540 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:24,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 481 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:29:24,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2023-11-06 22:29:24,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2023-11-06 22:29:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 299 states have (on average 1.0869565217391304) internal successors, (325), 325 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 325 transitions. [2023-11-06 22:29:24,697 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 325 transitions. Word has length 229 [2023-11-06 22:29:24,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:24,698 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 325 transitions. [2023-11-06 22:29:24,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 45.8) internal successors, (229), 6 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:24,698 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 325 transitions. [2023-11-06 22:29:24,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2023-11-06 22:29:24,700 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:24,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:24,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2023-11-06 22:29:24,700 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr140REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:24,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:24,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1163196692, now seen corresponding path program 1 times [2023-11-06 22:29:24,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:24,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229665697] [2023-11-06 22:29:24,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:24,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:25,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:25,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:25,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229665697] [2023-11-06 22:29:25,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229665697] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:25,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:25,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:29:25,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449334280] [2023-11-06 22:29:25,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:25,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:25,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:25,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:25,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:29:25,036 INFO L87 Difference]: Start difference. First operand 326 states and 325 transitions. Second operand has 4 states, 3 states have (on average 78.0) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:25,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:25,251 INFO L93 Difference]: Finished difference Result 325 states and 324 transitions. [2023-11-06 22:29:25,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:25,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 78.0) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2023-11-06 22:29:25,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:25,253 INFO L225 Difference]: With dead ends: 325 [2023-11-06 22:29:25,253 INFO L226 Difference]: Without dead ends: 325 [2023-11-06 22:29:25,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:29:25,254 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 183 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:25,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 397 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:29:25,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2023-11-06 22:29:25,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2023-11-06 22:29:25,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 299 states have (on average 1.0836120401337792) internal successors, (324), 324 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:25,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 324 transitions. [2023-11-06 22:29:25,259 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 324 transitions. Word has length 234 [2023-11-06 22:29:25,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:25,260 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 324 transitions. [2023-11-06 22:29:25,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 78.0) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:25,260 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 324 transitions. [2023-11-06 22:29:25,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2023-11-06 22:29:25,262 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:25,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:25,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2023-11-06 22:29:25,262 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr141REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:25,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:25,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1163196691, now seen corresponding path program 1 times [2023-11-06 22:29:25,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:25,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811993640] [2023-11-06 22:29:25,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:25,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:26,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:26,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:26,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811993640] [2023-11-06 22:29:26,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811993640] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:26,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:26,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:29:26,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504926521] [2023-11-06 22:29:26,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:26,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:29:26,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:26,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:29:26,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:29:26,061 INFO L87 Difference]: Start difference. First operand 325 states and 324 transitions. Second operand has 6 states, 5 states have (on average 46.8) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:26,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:26,568 INFO L93 Difference]: Finished difference Result 324 states and 323 transitions. [2023-11-06 22:29:26,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:29:26,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 46.8) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2023-11-06 22:29:26,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:26,570 INFO L225 Difference]: With dead ends: 324 [2023-11-06 22:29:26,570 INFO L226 Difference]: Without dead ends: 324 [2023-11-06 22:29:26,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:29:26,570 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 522 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:26,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 483 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:29:26,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2023-11-06 22:29:26,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2023-11-06 22:29:26,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 299 states have (on average 1.080267558528428) internal successors, (323), 323 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:26,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 323 transitions. [2023-11-06 22:29:26,575 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 323 transitions. Word has length 234 [2023-11-06 22:29:26,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:26,576 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 323 transitions. [2023-11-06 22:29:26,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 46.8) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:26,576 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 323 transitions. [2023-11-06 22:29:26,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-11-06 22:29:26,578 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:26,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:26,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2023-11-06 22:29:26,578 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr142REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:26,579 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:26,579 INFO L85 PathProgramCache]: Analyzing trace with hash 755593571, now seen corresponding path program 1 times [2023-11-06 22:29:26,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:26,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589674590] [2023-11-06 22:29:26,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:26,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:26,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:26,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:26,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589674590] [2023-11-06 22:29:26,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589674590] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:26,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:26,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:29:26,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167138502] [2023-11-06 22:29:26,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:26,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:26,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:26,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:26,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:29:26,846 INFO L87 Difference]: Start difference. First operand 324 states and 323 transitions. Second operand has 4 states, 3 states have (on average 79.66666666666667) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:27,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:27,068 INFO L93 Difference]: Finished difference Result 323 states and 322 transitions. [2023-11-06 22:29:27,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:27,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 79.66666666666667) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 239 [2023-11-06 22:29:27,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:27,070 INFO L225 Difference]: With dead ends: 323 [2023-11-06 22:29:27,070 INFO L226 Difference]: Without dead ends: 323 [2023-11-06 22:29:27,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:29:27,071 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 169 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:27,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 399 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:29:27,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2023-11-06 22:29:27,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2023-11-06 22:29:27,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 299 states have (on average 1.0769230769230769) internal successors, (322), 322 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:27,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 322 transitions. [2023-11-06 22:29:27,077 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 322 transitions. Word has length 239 [2023-11-06 22:29:27,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:27,077 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 322 transitions. [2023-11-06 22:29:27,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 79.66666666666667) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:27,078 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 322 transitions. [2023-11-06 22:29:27,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-11-06 22:29:27,079 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:27,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:27,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2023-11-06 22:29:27,080 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr143REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:27,080 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:27,080 INFO L85 PathProgramCache]: Analyzing trace with hash 755593572, now seen corresponding path program 1 times [2023-11-06 22:29:27,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:27,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968220492] [2023-11-06 22:29:27,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:27,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:27,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:27,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:27,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968220492] [2023-11-06 22:29:27,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968220492] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:27,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:27,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:29:27,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581653810] [2023-11-06 22:29:27,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:27,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:29:27,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:27,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:29:27,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:29:27,778 INFO L87 Difference]: Start difference. First operand 323 states and 322 transitions. Second operand has 7 states, 6 states have (on average 39.833333333333336) internal successors, (239), 7 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:28,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:28,286 INFO L93 Difference]: Finished difference Result 322 states and 321 transitions. [2023-11-06 22:29:28,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:29:28,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 39.833333333333336) internal successors, (239), 7 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 239 [2023-11-06 22:29:28,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:28,288 INFO L225 Difference]: With dead ends: 322 [2023-11-06 22:29:28,288 INFO L226 Difference]: Without dead ends: 322 [2023-11-06 22:29:28,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:29:28,289 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 419 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:28,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 526 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:29:28,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2023-11-06 22:29:28,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2023-11-06 22:29:28,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 299 states have (on average 1.0735785953177257) internal successors, (321), 321 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:28,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 321 transitions. [2023-11-06 22:29:28,294 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 321 transitions. Word has length 239 [2023-11-06 22:29:28,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:28,294 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 321 transitions. [2023-11-06 22:29:28,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 39.833333333333336) internal successors, (239), 7 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:28,294 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 321 transitions. [2023-11-06 22:29:28,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-11-06 22:29:28,295 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:28,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:28,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2023-11-06 22:29:28,296 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr144REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:28,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:28,296 INFO L85 PathProgramCache]: Analyzing trace with hash 858096925, now seen corresponding path program 1 times [2023-11-06 22:29:28,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:28,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355033978] [2023-11-06 22:29:28,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:28,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:28,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:28,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:28,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355033978] [2023-11-06 22:29:28,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355033978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:28,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:28,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:29:28,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732053527] [2023-11-06 22:29:28,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:28,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:28,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:28,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:28,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:29:28,585 INFO L87 Difference]: Start difference. First operand 322 states and 321 transitions. Second operand has 4 states, 3 states have (on average 81.33333333333333) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:28,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:28,798 INFO L93 Difference]: Finished difference Result 321 states and 320 transitions. [2023-11-06 22:29:28,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:28,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 81.33333333333333) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 244 [2023-11-06 22:29:28,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:28,800 INFO L225 Difference]: With dead ends: 321 [2023-11-06 22:29:28,801 INFO L226 Difference]: Without dead ends: 321 [2023-11-06 22:29:28,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:29:28,801 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 155 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:28,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 401 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:29:28,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2023-11-06 22:29:28,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2023-11-06 22:29:28,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 299 states have (on average 1.0702341137123745) internal successors, (320), 320 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:28,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 320 transitions. [2023-11-06 22:29:28,806 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 320 transitions. Word has length 244 [2023-11-06 22:29:28,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:28,806 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 320 transitions. [2023-11-06 22:29:28,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 81.33333333333333) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:28,806 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 320 transitions. [2023-11-06 22:29:28,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-11-06 22:29:28,807 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:28,807 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:28,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2023-11-06 22:29:28,807 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:28,808 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:28,808 INFO L85 PathProgramCache]: Analyzing trace with hash 858096926, now seen corresponding path program 1 times [2023-11-06 22:29:28,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:28,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919992030] [2023-11-06 22:29:28,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:28,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:29,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:29,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919992030] [2023-11-06 22:29:29,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919992030] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:29,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:29,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:29:29,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749745302] [2023-11-06 22:29:29,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:29,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:29:29,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:29,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:29:29,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:29:29,520 INFO L87 Difference]: Start difference. First operand 321 states and 320 transitions. Second operand has 7 states, 6 states have (on average 40.666666666666664) internal successors, (244), 7 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:30,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:30,048 INFO L93 Difference]: Finished difference Result 320 states and 319 transitions. [2023-11-06 22:29:30,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:29:30,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 40.666666666666664) internal successors, (244), 7 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 244 [2023-11-06 22:29:30,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:30,050 INFO L225 Difference]: With dead ends: 320 [2023-11-06 22:29:30,050 INFO L226 Difference]: Without dead ends: 320 [2023-11-06 22:29:30,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:29:30,050 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 408 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:30,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 569 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:29:30,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2023-11-06 22:29:30,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2023-11-06 22:29:30,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 299 states have (on average 1.0668896321070234) internal successors, (319), 319 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:30,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 319 transitions. [2023-11-06 22:29:30,056 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 319 transitions. Word has length 244 [2023-11-06 22:29:30,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:30,056 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 319 transitions. [2023-11-06 22:29:30,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 40.666666666666664) internal successors, (244), 7 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:30,057 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 319 transitions. [2023-11-06 22:29:30,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2023-11-06 22:29:30,058 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:30,058 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:30,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2023-11-06 22:29:30,059 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr146REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:30,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:30,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1224360308, now seen corresponding path program 1 times [2023-11-06 22:29:30,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:30,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171802642] [2023-11-06 22:29:30,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:30,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:30,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:30,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:30,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171802642] [2023-11-06 22:29:30,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171802642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:30,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:30,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:29:30,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940587180] [2023-11-06 22:29:30,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:30,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:30,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:30,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:30,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:29:30,363 INFO L87 Difference]: Start difference. First operand 320 states and 319 transitions. Second operand has 4 states, 3 states have (on average 83.0) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:30,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:30,602 INFO L93 Difference]: Finished difference Result 319 states and 318 transitions. [2023-11-06 22:29:30,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:30,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 83.0) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 249 [2023-11-06 22:29:30,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:30,604 INFO L225 Difference]: With dead ends: 319 [2023-11-06 22:29:30,604 INFO L226 Difference]: Without dead ends: 319 [2023-11-06 22:29:30,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:29:30,605 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 141 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:30,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 403 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:29:30,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-11-06 22:29:30,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2023-11-06 22:29:30,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 299 states have (on average 1.0635451505016722) internal successors, (318), 318 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:30,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 318 transitions. [2023-11-06 22:29:30,609 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 318 transitions. Word has length 249 [2023-11-06 22:29:30,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:30,610 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 318 transitions. [2023-11-06 22:29:30,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 83.0) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:30,610 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 318 transitions. [2023-11-06 22:29:30,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2023-11-06 22:29:30,612 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:30,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:30,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2023-11-06 22:29:30,612 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr147REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:30,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:30,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1224360309, now seen corresponding path program 1 times [2023-11-06 22:29:30,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:30,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771517595] [2023-11-06 22:29:30,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:30,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:31,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:31,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771517595] [2023-11-06 22:29:31,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771517595] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:31,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:31,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:29:31,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297745184] [2023-11-06 22:29:31,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:31,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:29:31,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:31,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:29:31,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:29:31,565 INFO L87 Difference]: Start difference. First operand 319 states and 318 transitions. Second operand has 7 states, 6 states have (on average 41.5) internal successors, (249), 7 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:32,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:32,103 INFO L93 Difference]: Finished difference Result 318 states and 317 transitions. [2023-11-06 22:29:32,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:29:32,103 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 41.5) internal successors, (249), 7 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 249 [2023-11-06 22:29:32,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:32,105 INFO L225 Difference]: With dead ends: 318 [2023-11-06 22:29:32,105 INFO L226 Difference]: Without dead ends: 318 [2023-11-06 22:29:32,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:29:32,106 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 621 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:32,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 530 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:29:32,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2023-11-06 22:29:32,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2023-11-06 22:29:32,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 299 states have (on average 1.060200668896321) internal successors, (317), 317 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:32,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 317 transitions. [2023-11-06 22:29:32,111 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 317 transitions. Word has length 249 [2023-11-06 22:29:32,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:32,111 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 317 transitions. [2023-11-06 22:29:32,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 41.5) internal successors, (249), 7 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:32,112 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 317 transitions. [2023-11-06 22:29:32,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2023-11-06 22:29:32,113 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:32,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:32,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2023-11-06 22:29:32,114 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr148REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:32,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:32,114 INFO L85 PathProgramCache]: Analyzing trace with hash 472395598, now seen corresponding path program 1 times [2023-11-06 22:29:32,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:32,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206843462] [2023-11-06 22:29:32,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:32,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:32,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:32,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:32,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206843462] [2023-11-06 22:29:32,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206843462] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:32,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:32,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:29:32,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920375372] [2023-11-06 22:29:32,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:32,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:32,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:32,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:32,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:29:32,582 INFO L87 Difference]: Start difference. First operand 318 states and 317 transitions. Second operand has 4 states, 3 states have (on average 84.66666666666667) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:32,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:32,827 INFO L93 Difference]: Finished difference Result 317 states and 316 transitions. [2023-11-06 22:29:32,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:32,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 84.66666666666667) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 254 [2023-11-06 22:29:32,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:32,829 INFO L225 Difference]: With dead ends: 317 [2023-11-06 22:29:32,830 INFO L226 Difference]: Without dead ends: 317 [2023-11-06 22:29:32,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:29:32,830 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 127 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:32,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 405 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:29:32,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2023-11-06 22:29:32,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2023-11-06 22:29:32,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 299 states have (on average 1.0568561872909699) internal successors, (316), 316 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:32,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 316 transitions. [2023-11-06 22:29:32,835 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 316 transitions. Word has length 254 [2023-11-06 22:29:32,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:32,836 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 316 transitions. [2023-11-06 22:29:32,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 84.66666666666667) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 316 transitions. [2023-11-06 22:29:32,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2023-11-06 22:29:32,838 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:32,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:32,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2023-11-06 22:29:32,838 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr149REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:32,839 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:32,839 INFO L85 PathProgramCache]: Analyzing trace with hash 472395599, now seen corresponding path program 1 times [2023-11-06 22:29:32,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:32,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924426555] [2023-11-06 22:29:32,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:32,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:33,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:33,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:33,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924426555] [2023-11-06 22:29:33,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924426555] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:33,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:33,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:29:33,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189226859] [2023-11-06 22:29:33,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:33,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:29:33,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:33,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:29:33,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:29:33,649 INFO L87 Difference]: Start difference. First operand 317 states and 316 transitions. Second operand has 7 states, 6 states have (on average 42.333333333333336) internal successors, (254), 7 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:34,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:34,172 INFO L93 Difference]: Finished difference Result 316 states and 315 transitions. [2023-11-06 22:29:34,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:29:34,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 42.333333333333336) internal successors, (254), 7 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 254 [2023-11-06 22:29:34,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:34,173 INFO L225 Difference]: With dead ends: 316 [2023-11-06 22:29:34,173 INFO L226 Difference]: Without dead ends: 316 [2023-11-06 22:29:34,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:29:34,174 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 608 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:34,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 532 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:29:34,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2023-11-06 22:29:34,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2023-11-06 22:29:34,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 299 states have (on average 1.0535117056856187) internal successors, (315), 315 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:34,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 315 transitions. [2023-11-06 22:29:34,179 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 315 transitions. Word has length 254 [2023-11-06 22:29:34,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:34,180 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 315 transitions. [2023-11-06 22:29:34,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 42.333333333333336) internal successors, (254), 7 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:34,180 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 315 transitions. [2023-11-06 22:29:34,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2023-11-06 22:29:34,182 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:34,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:34,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2023-11-06 22:29:34,182 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr150REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:34,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:34,183 INFO L85 PathProgramCache]: Analyzing trace with hash 513697157, now seen corresponding path program 1 times [2023-11-06 22:29:34,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:34,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216353419] [2023-11-06 22:29:34,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:34,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:34,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:34,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:34,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216353419] [2023-11-06 22:29:34,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216353419] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:34,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:34,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:29:34,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425815065] [2023-11-06 22:29:34,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:34,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:34,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:34,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:34,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:29:34,496 INFO L87 Difference]: Start difference. First operand 316 states and 315 transitions. Second operand has 4 states, 3 states have (on average 86.33333333333333) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:34,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:34,712 INFO L93 Difference]: Finished difference Result 315 states and 314 transitions. [2023-11-06 22:29:34,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:34,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 86.33333333333333) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 259 [2023-11-06 22:29:34,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:34,714 INFO L225 Difference]: With dead ends: 315 [2023-11-06 22:29:34,714 INFO L226 Difference]: Without dead ends: 315 [2023-11-06 22:29:34,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:29:34,714 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 113 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:34,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 407 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:29:34,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2023-11-06 22:29:34,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2023-11-06 22:29:34,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 299 states have (on average 1.0501672240802675) internal successors, (314), 314 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:34,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 314 transitions. [2023-11-06 22:29:34,718 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 314 transitions. Word has length 259 [2023-11-06 22:29:34,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:34,719 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 314 transitions. [2023-11-06 22:29:34,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 86.33333333333333) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:34,719 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 314 transitions. [2023-11-06 22:29:34,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2023-11-06 22:29:34,720 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:34,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:34,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2023-11-06 22:29:34,721 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr151REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:34,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:34,722 INFO L85 PathProgramCache]: Analyzing trace with hash 513697158, now seen corresponding path program 1 times [2023-11-06 22:29:34,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:34,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811540799] [2023-11-06 22:29:34,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:34,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:35,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:35,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:35,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811540799] [2023-11-06 22:29:35,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811540799] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:35,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:35,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:29:35,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463251909] [2023-11-06 22:29:35,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:35,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:29:35,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:35,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:29:35,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:29:35,491 INFO L87 Difference]: Start difference. First operand 315 states and 314 transitions. Second operand has 7 states, 6 states have (on average 43.166666666666664) internal successors, (259), 7 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:36,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:36,028 INFO L93 Difference]: Finished difference Result 314 states and 313 transitions. [2023-11-06 22:29:36,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:29:36,028 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 43.166666666666664) internal successors, (259), 7 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 259 [2023-11-06 22:29:36,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:36,030 INFO L225 Difference]: With dead ends: 314 [2023-11-06 22:29:36,030 INFO L226 Difference]: Without dead ends: 314 [2023-11-06 22:29:36,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:29:36,030 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 375 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:36,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 575 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:29:36,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2023-11-06 22:29:36,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2023-11-06 22:29:36,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 299 states have (on average 1.0468227424749164) internal successors, (313), 313 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:36,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 313 transitions. [2023-11-06 22:29:36,036 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 313 transitions. Word has length 259 [2023-11-06 22:29:36,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:36,036 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 313 transitions. [2023-11-06 22:29:36,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 43.166666666666664) internal successors, (259), 7 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:36,037 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 313 transitions. [2023-11-06 22:29:36,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2023-11-06 22:29:36,038 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:36,038 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:36,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2023-11-06 22:29:36,039 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr152REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:36,039 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:36,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1167325825, now seen corresponding path program 1 times [2023-11-06 22:29:36,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:36,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203859671] [2023-11-06 22:29:36,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:36,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:36,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:36,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:36,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203859671] [2023-11-06 22:29:36,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203859671] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:36,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:36,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:29:36,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966097680] [2023-11-06 22:29:36,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:36,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:36,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:36,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:36,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:29:36,356 INFO L87 Difference]: Start difference. First operand 314 states and 313 transitions. Second operand has 4 states, 3 states have (on average 88.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:36,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:36,579 INFO L93 Difference]: Finished difference Result 313 states and 312 transitions. [2023-11-06 22:29:36,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:36,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 88.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 264 [2023-11-06 22:29:36,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:36,581 INFO L225 Difference]: With dead ends: 313 [2023-11-06 22:29:36,581 INFO L226 Difference]: Without dead ends: 313 [2023-11-06 22:29:36,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:29:36,581 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 99 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:36,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 409 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:29:36,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2023-11-06 22:29:36,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2023-11-06 22:29:36,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 299 states have (on average 1.0434782608695652) internal successors, (312), 312 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:36,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 312 transitions. [2023-11-06 22:29:36,587 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 312 transitions. Word has length 264 [2023-11-06 22:29:36,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:36,587 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 312 transitions. [2023-11-06 22:29:36,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 88.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:36,588 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 312 transitions. [2023-11-06 22:29:36,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2023-11-06 22:29:36,589 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:36,590 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:36,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2023-11-06 22:29:36,590 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr153REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:36,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:36,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1167325824, now seen corresponding path program 1 times [2023-11-06 22:29:36,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:36,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244181466] [2023-11-06 22:29:36,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:36,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:37,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:37,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:37,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244181466] [2023-11-06 22:29:37,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244181466] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:37,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:37,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:29:37,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681958824] [2023-11-06 22:29:37,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:37,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:29:37,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:37,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:29:37,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:29:37,362 INFO L87 Difference]: Start difference. First operand 313 states and 312 transitions. Second operand has 6 states, 5 states have (on average 52.8) internal successors, (264), 6 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:37,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:37,883 INFO L93 Difference]: Finished difference Result 312 states and 311 transitions. [2023-11-06 22:29:37,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:29:37,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 52.8) internal successors, (264), 6 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 264 [2023-11-06 22:29:37,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:37,885 INFO L225 Difference]: With dead ends: 312 [2023-11-06 22:29:37,885 INFO L226 Difference]: Without dead ends: 312 [2023-11-06 22:29:37,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:29:37,885 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 414 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:37,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 495 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:29:37,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2023-11-06 22:29:37,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2023-11-06 22:29:37,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 299 states have (on average 1.040133779264214) internal successors, (311), 311 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 311 transitions. [2023-11-06 22:29:37,889 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 311 transitions. Word has length 264 [2023-11-06 22:29:37,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:37,889 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 311 transitions. [2023-11-06 22:29:37,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 52.8) internal successors, (264), 6 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:37,889 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 311 transitions. [2023-11-06 22:29:37,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2023-11-06 22:29:37,891 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:37,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:37,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2023-11-06 22:29:37,892 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr154REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:37,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:37,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1960631702, now seen corresponding path program 1 times [2023-11-06 22:29:37,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:37,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672014038] [2023-11-06 22:29:37,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:37,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:38,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:38,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:38,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672014038] [2023-11-06 22:29:38,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672014038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:38,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:38,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:29:38,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747975203] [2023-11-06 22:29:38,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:38,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:38,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:38,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:38,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:29:38,222 INFO L87 Difference]: Start difference. First operand 312 states and 311 transitions. Second operand has 4 states, 3 states have (on average 89.66666666666667) internal successors, (269), 4 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:38,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:38,467 INFO L93 Difference]: Finished difference Result 311 states and 310 transitions. [2023-11-06 22:29:38,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:38,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 89.66666666666667) internal successors, (269), 4 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 269 [2023-11-06 22:29:38,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:38,470 INFO L225 Difference]: With dead ends: 311 [2023-11-06 22:29:38,470 INFO L226 Difference]: Without dead ends: 311 [2023-11-06 22:29:38,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:29:38,471 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 85 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:38,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 411 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:29:38,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2023-11-06 22:29:38,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2023-11-06 22:29:38,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 299 states have (on average 1.0367892976588629) internal successors, (310), 310 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:38,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 310 transitions. [2023-11-06 22:29:38,477 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 310 transitions. Word has length 269 [2023-11-06 22:29:38,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:38,477 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 310 transitions. [2023-11-06 22:29:38,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 89.66666666666667) internal successors, (269), 4 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:38,477 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 310 transitions. [2023-11-06 22:29:38,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2023-11-06 22:29:38,479 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:38,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:38,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2023-11-06 22:29:38,480 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr155REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:38,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:38,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1960631703, now seen corresponding path program 1 times [2023-11-06 22:29:38,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:38,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283785225] [2023-11-06 22:29:38,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:38,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:39,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:39,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:39,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283785225] [2023-11-06 22:29:39,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283785225] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:39,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:39,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:29:39,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615060102] [2023-11-06 22:29:39,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:39,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:29:39,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:39,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:29:39,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:29:39,296 INFO L87 Difference]: Start difference. First operand 311 states and 310 transitions. Second operand has 6 states, 5 states have (on average 53.8) internal successors, (269), 6 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:39,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:39,864 INFO L93 Difference]: Finished difference Result 310 states and 309 transitions. [2023-11-06 22:29:39,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:29:39,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 53.8) internal successors, (269), 6 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 269 [2023-11-06 22:29:39,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:39,866 INFO L225 Difference]: With dead ends: 310 [2023-11-06 22:29:39,866 INFO L226 Difference]: Without dead ends: 310 [2023-11-06 22:29:39,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:29:39,866 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 353 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:39,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 538 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:29:39,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2023-11-06 22:29:39,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2023-11-06 22:29:39,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 299 states have (on average 1.0334448160535117) internal successors, (309), 309 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:39,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 309 transitions. [2023-11-06 22:29:39,871 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 309 transitions. Word has length 269 [2023-11-06 22:29:39,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:39,871 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 309 transitions. [2023-11-06 22:29:39,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 53.8) internal successors, (269), 6 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:39,872 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 309 transitions. [2023-11-06 22:29:39,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2023-11-06 22:29:39,873 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:39,873 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:39,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2023-11-06 22:29:39,873 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr156REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:39,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:39,874 INFO L85 PathProgramCache]: Analyzing trace with hash 2137655216, now seen corresponding path program 1 times [2023-11-06 22:29:39,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:39,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135198153] [2023-11-06 22:29:39,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:39,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:40,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:40,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:40,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135198153] [2023-11-06 22:29:40,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135198153] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:40,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:40,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:29:40,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913950915] [2023-11-06 22:29:40,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:40,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:40,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:40,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:40,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:29:40,201 INFO L87 Difference]: Start difference. First operand 310 states and 309 transitions. Second operand has 4 states, 3 states have (on average 91.33333333333333) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:40,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:40,417 INFO L93 Difference]: Finished difference Result 309 states and 308 transitions. [2023-11-06 22:29:40,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:40,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 91.33333333333333) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2023-11-06 22:29:40,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:40,419 INFO L225 Difference]: With dead ends: 309 [2023-11-06 22:29:40,419 INFO L226 Difference]: Without dead ends: 309 [2023-11-06 22:29:40,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:29:40,420 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 71 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:40,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 413 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:29:40,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2023-11-06 22:29:40,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2023-11-06 22:29:40,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 299 states have (on average 1.0301003344481605) internal successors, (308), 308 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:40,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 308 transitions. [2023-11-06 22:29:40,425 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 308 transitions. Word has length 274 [2023-11-06 22:29:40,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:40,425 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 308 transitions. [2023-11-06 22:29:40,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 91.33333333333333) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:40,425 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 308 transitions. [2023-11-06 22:29:40,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2023-11-06 22:29:40,427 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:40,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:40,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2023-11-06 22:29:40,427 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr157REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:40,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:40,428 INFO L85 PathProgramCache]: Analyzing trace with hash 2137655217, now seen corresponding path program 1 times [2023-11-06 22:29:40,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:40,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495852715] [2023-11-06 22:29:40,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:40,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:41,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:41,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:41,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495852715] [2023-11-06 22:29:41,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495852715] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:41,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:41,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:29:41,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753789263] [2023-11-06 22:29:41,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:41,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:29:41,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:41,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:29:41,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:29:41,212 INFO L87 Difference]: Start difference. First operand 309 states and 308 transitions. Second operand has 6 states, 5 states have (on average 54.8) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:41,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:41,775 INFO L93 Difference]: Finished difference Result 308 states and 307 transitions. [2023-11-06 22:29:41,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:29:41,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 54.8) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2023-11-06 22:29:41,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:41,777 INFO L225 Difference]: With dead ends: 308 [2023-11-06 22:29:41,777 INFO L226 Difference]: Without dead ends: 308 [2023-11-06 22:29:41,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:29:41,778 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 378 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:41,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 499 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:29:41,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2023-11-06 22:29:41,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2023-11-06 22:29:41,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 299 states have (on average 1.0267558528428093) internal successors, (307), 307 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:41,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 307 transitions. [2023-11-06 22:29:41,782 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 307 transitions. Word has length 274 [2023-11-06 22:29:41,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:41,783 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 307 transitions. [2023-11-06 22:29:41,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 54.8) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:41,783 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 307 transitions. [2023-11-06 22:29:41,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2023-11-06 22:29:41,785 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:41,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:41,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2023-11-06 22:29:41,786 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr158REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:41,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:41,786 INFO L85 PathProgramCache]: Analyzing trace with hash -572741209, now seen corresponding path program 1 times [2023-11-06 22:29:41,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:41,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332670231] [2023-11-06 22:29:41,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:41,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:42,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:42,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:42,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332670231] [2023-11-06 22:29:42,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332670231] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:42,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:42,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:29:42,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757266432] [2023-11-06 22:29:42,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:42,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:42,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:42,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:42,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:29:42,230 INFO L87 Difference]: Start difference. First operand 308 states and 307 transitions. Second operand has 4 states, 3 states have (on average 93.0) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:42,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:42,459 INFO L93 Difference]: Finished difference Result 307 states and 306 transitions. [2023-11-06 22:29:42,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:42,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 93.0) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 279 [2023-11-06 22:29:42,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:42,461 INFO L225 Difference]: With dead ends: 307 [2023-11-06 22:29:42,461 INFO L226 Difference]: Without dead ends: 307 [2023-11-06 22:29:42,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:29:42,461 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 57 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:42,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 415 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:29:42,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2023-11-06 22:29:42,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2023-11-06 22:29:42,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 299 states have (on average 1.0234113712374582) internal successors, (306), 306 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:42,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 306 transitions. [2023-11-06 22:29:42,467 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 306 transitions. Word has length 279 [2023-11-06 22:29:42,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:42,467 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 306 transitions. [2023-11-06 22:29:42,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 93.0) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:42,467 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 306 transitions. [2023-11-06 22:29:42,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2023-11-06 22:29:42,469 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:42,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:42,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2023-11-06 22:29:42,470 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr159REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:42,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:42,470 INFO L85 PathProgramCache]: Analyzing trace with hash -572741208, now seen corresponding path program 1 times [2023-11-06 22:29:42,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:42,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141677811] [2023-11-06 22:29:42,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:42,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:43,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:43,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:43,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141677811] [2023-11-06 22:29:43,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141677811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:43,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:43,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:29:43,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212709086] [2023-11-06 22:29:43,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:43,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:29:43,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:43,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:29:43,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:29:43,333 INFO L87 Difference]: Start difference. First operand 307 states and 306 transitions. Second operand has 7 states, 6 states have (on average 46.5) internal successors, (279), 7 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:43,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:43,842 INFO L93 Difference]: Finished difference Result 306 states and 305 transitions. [2023-11-06 22:29:43,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:29:43,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 46.5) internal successors, (279), 7 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 279 [2023-11-06 22:29:43,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:43,844 INFO L225 Difference]: With dead ends: 306 [2023-11-06 22:29:43,844 INFO L226 Difference]: Without dead ends: 306 [2023-11-06 22:29:43,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:29:43,844 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 331 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:43,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 542 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:29:43,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2023-11-06 22:29:43,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2023-11-06 22:29:43,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 299 states have (on average 1.020066889632107) internal successors, (305), 305 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:43,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 305 transitions. [2023-11-06 22:29:43,848 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 305 transitions. Word has length 279 [2023-11-06 22:29:43,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:43,848 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 305 transitions. [2023-11-06 22:29:43,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 46.5) internal successors, (279), 7 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:43,848 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 305 transitions. [2023-11-06 22:29:43,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2023-11-06 22:29:43,849 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:43,849 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:43,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2023-11-06 22:29:43,850 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr161REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:43,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:43,850 INFO L85 PathProgramCache]: Analyzing trace with hash 425407970, now seen corresponding path program 1 times [2023-11-06 22:29:43,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:43,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943791522] [2023-11-06 22:29:43,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:43,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:44,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:44,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:44,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943791522] [2023-11-06 22:29:44,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943791522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:44,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:44,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:29:44,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927110018] [2023-11-06 22:29:44,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:44,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:29:44,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:44,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:29:44,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:29:44,657 INFO L87 Difference]: Start difference. First operand 306 states and 305 transitions. Second operand has 7 states, 6 states have (on average 47.333333333333336) internal successors, (284), 7 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:45,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:45,166 INFO L93 Difference]: Finished difference Result 305 states and 304 transitions. [2023-11-06 22:29:45,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:29:45,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 47.333333333333336) internal successors, (284), 7 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 284 [2023-11-06 22:29:45,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:45,167 INFO L225 Difference]: With dead ends: 305 [2023-11-06 22:29:45,167 INFO L226 Difference]: Without dead ends: 305 [2023-11-06 22:29:45,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:29:45,167 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 323 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:45,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 544 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:29:45,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-11-06 22:29:45,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2023-11-06 22:29:45,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 299 states have (on average 1.0167224080267558) internal successors, (304), 304 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:45,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 304 transitions. [2023-11-06 22:29:45,172 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 304 transitions. Word has length 284 [2023-11-06 22:29:45,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:45,173 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 304 transitions. [2023-11-06 22:29:45,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 47.333333333333336) internal successors, (284), 7 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:45,173 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 304 transitions. [2023-11-06 22:29:45,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2023-11-06 22:29:45,174 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:45,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:45,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2023-11-06 22:29:45,175 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr160REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:45,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:45,176 INFO L85 PathProgramCache]: Analyzing trace with hash 425407969, now seen corresponding path program 1 times [2023-11-06 22:29:45,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:45,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662723548] [2023-11-06 22:29:45,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:45,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:45,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:45,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:45,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662723548] [2023-11-06 22:29:45,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662723548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:45,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:45,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:29:45,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761557036] [2023-11-06 22:29:45,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:45,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:45,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:45,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:45,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:29:45,498 INFO L87 Difference]: Start difference. First operand 305 states and 304 transitions. Second operand has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:45,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:45,711 INFO L93 Difference]: Finished difference Result 304 states and 303 transitions. [2023-11-06 22:29:45,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:45,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 284 [2023-11-06 22:29:45,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:45,713 INFO L225 Difference]: With dead ends: 304 [2023-11-06 22:29:45,713 INFO L226 Difference]: Without dead ends: 304 [2023-11-06 22:29:45,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:29:45,714 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 41 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:45,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 417 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:29:45,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2023-11-06 22:29:45,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2023-11-06 22:29:45,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 299 states have (on average 1.0133779264214047) internal successors, (303), 303 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:45,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 303 transitions. [2023-11-06 22:29:45,719 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 303 transitions. Word has length 284 [2023-11-06 22:29:45,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:45,719 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 303 transitions. [2023-11-06 22:29:45,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:45,720 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 303 transitions. [2023-11-06 22:29:45,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2023-11-06 22:29:45,721 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:45,722 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:45,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2023-11-06 22:29:45,722 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr162REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:45,722 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:45,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1492858440, now seen corresponding path program 1 times [2023-11-06 22:29:45,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:45,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484064911] [2023-11-06 22:29:45,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:45,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:46,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:46,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:46,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484064911] [2023-11-06 22:29:46,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484064911] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:46,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:46,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:29:46,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445100481] [2023-11-06 22:29:46,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:46,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:46,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:46,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:46,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:29:46,066 INFO L87 Difference]: Start difference. First operand 304 states and 303 transitions. Second operand has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:46,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:46,279 INFO L93 Difference]: Finished difference Result 303 states and 302 transitions. [2023-11-06 22:29:46,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:46,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 289 [2023-11-06 22:29:46,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:46,281 INFO L225 Difference]: With dead ends: 303 [2023-11-06 22:29:46,281 INFO L226 Difference]: Without dead ends: 303 [2023-11-06 22:29:46,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:29:46,281 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 29 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:46,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 419 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:29:46,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-11-06 22:29:46,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2023-11-06 22:29:46,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 299 states have (on average 1.0100334448160535) internal successors, (302), 302 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 302 transitions. [2023-11-06 22:29:46,286 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 302 transitions. Word has length 289 [2023-11-06 22:29:46,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:46,286 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 302 transitions. [2023-11-06 22:29:46,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 302 transitions. [2023-11-06 22:29:46,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2023-11-06 22:29:46,288 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:46,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:46,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2023-11-06 22:29:46,289 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr163REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:46,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:46,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1492858439, now seen corresponding path program 1 times [2023-11-06 22:29:46,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:46,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917446648] [2023-11-06 22:29:46,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:46,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:47,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:47,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917446648] [2023-11-06 22:29:47,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917446648] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:47,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:47,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:29:47,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853017386] [2023-11-06 22:29:47,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:47,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:29:47,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:47,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:29:47,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:29:47,491 INFO L87 Difference]: Start difference. First operand 303 states and 302 transitions. Second operand has 7 states, 6 states have (on average 48.166666666666664) internal successors, (289), 7 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:47,981 INFO L93 Difference]: Finished difference Result 302 states and 301 transitions. [2023-11-06 22:29:47,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:29:47,981 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 48.166666666666664) internal successors, (289), 7 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 289 [2023-11-06 22:29:47,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:47,983 INFO L225 Difference]: With dead ends: 302 [2023-11-06 22:29:47,983 INFO L226 Difference]: Without dead ends: 302 [2023-11-06 22:29:47,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:29:47,983 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 532 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:47,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 505 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:29:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2023-11-06 22:29:47,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2023-11-06 22:29:47,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 299 states have (on average 1.0066889632107023) internal successors, (301), 301 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:47,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 301 transitions. [2023-11-06 22:29:47,989 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 301 transitions. Word has length 289 [2023-11-06 22:29:47,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:47,989 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 301 transitions. [2023-11-06 22:29:47,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 48.166666666666664) internal successors, (289), 7 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:47,989 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 301 transitions. [2023-11-06 22:29:47,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2023-11-06 22:29:47,991 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:47,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:47,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2023-11-06 22:29:47,991 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr164REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:47,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:47,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2093445102, now seen corresponding path program 1 times [2023-11-06 22:29:47,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:47,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670172324] [2023-11-06 22:29:47,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:47,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:48,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:48,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:48,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670172324] [2023-11-06 22:29:48,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670172324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:48,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:48,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:29:48,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507307253] [2023-11-06 22:29:48,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:48,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:29:48,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:48,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:29:48,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:29:48,362 INFO L87 Difference]: Start difference. First operand 302 states and 301 transitions. Second operand has 4 states, 3 states have (on average 98.0) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:48,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:48,577 INFO L93 Difference]: Finished difference Result 301 states and 300 transitions. [2023-11-06 22:29:48,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:29:48,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 98.0) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 294 [2023-11-06 22:29:48,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:48,578 INFO L225 Difference]: With dead ends: 301 [2023-11-06 22:29:48,578 INFO L226 Difference]: Without dead ends: 301 [2023-11-06 22:29:48,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:29:48,579 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 15 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:48,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 421 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:29:48,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2023-11-06 22:29:48,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2023-11-06 22:29:48,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 299 states have (on average 1.0033444816053512) internal successors, (300), 300 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:48,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 300 transitions. [2023-11-06 22:29:48,584 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 300 transitions. Word has length 294 [2023-11-06 22:29:48,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:48,584 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 300 transitions. [2023-11-06 22:29:48,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 98.0) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 300 transitions. [2023-11-06 22:29:48,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2023-11-06 22:29:48,586 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:48,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:48,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2023-11-06 22:29:48,587 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr165REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:48,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:48,588 INFO L85 PathProgramCache]: Analyzing trace with hash -2093445101, now seen corresponding path program 1 times [2023-11-06 22:29:48,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:48,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694490364] [2023-11-06 22:29:48,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:48,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:49,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:49,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694490364] [2023-11-06 22:29:49,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694490364] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:49,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:49,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:29:49,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763578694] [2023-11-06 22:29:49,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:49,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:29:49,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:49,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:29:49,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:29:49,515 INFO L87 Difference]: Start difference. First operand 301 states and 300 transitions. Second operand has 7 states, 6 states have (on average 49.0) internal successors, (294), 7 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:50,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:29:50,016 INFO L93 Difference]: Finished difference Result 300 states and 299 transitions. [2023-11-06 22:29:50,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:29:50,016 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 49.0) internal successors, (294), 7 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 294 [2023-11-06 22:29:50,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:29:50,017 INFO L225 Difference]: With dead ends: 300 [2023-11-06 22:29:50,017 INFO L226 Difference]: Without dead ends: 300 [2023-11-06 22:29:50,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:29:50,017 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 504 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:29:50,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 548 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:29:50,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-06 22:29:50,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-06 22:29:50,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.0) internal successors, (299), 299 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:50,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 299 transitions. [2023-11-06 22:29:50,020 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 299 transitions. Word has length 294 [2023-11-06 22:29:50,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:29:50,020 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 299 transitions. [2023-11-06 22:29:50,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 49.0) internal successors, (294), 7 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:29:50,021 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 299 transitions. [2023-11-06 22:29:50,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2023-11-06 22:29:50,022 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:29:50,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:50,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2023-11-06 22:29:50,023 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr166ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2023-11-06 22:29:50,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:29:50,024 INFO L85 PathProgramCache]: Analyzing trace with hash -922991286, now seen corresponding path program 1 times [2023-11-06 22:29:50,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:29:50,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058165342] [2023-11-06 22:29:50,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:29:50,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:29:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:29:57,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:29:57,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:29:57,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058165342] [2023-11-06 22:29:57,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058165342] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:57,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:57,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2023-11-06 22:29:57,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974161457] [2023-11-06 22:29:57,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:57,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-06 22:29:57,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:29:57,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-06 22:29:57,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2545, Unknown=0, NotChecked=0, Total=2652 [2023-11-06 22:29:57,277 INFO L87 Difference]: Start difference. First operand 300 states and 299 transitions. Second operand has 52 states, 52 states have (on average 5.75) internal successors, (299), 52 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:30:00,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:00,657 INFO L93 Difference]: Finished difference Result 295 states and 294 transitions. [2023-11-06 22:30:00,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-11-06 22:30:00,657 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 5.75) internal successors, (299), 52 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 299 [2023-11-06 22:30:00,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:00,658 INFO L225 Difference]: With dead ends: 295 [2023-11-06 22:30:00,658 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:30:00,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=119, Invalid=2743, Unknown=0, NotChecked=0, Total=2862 [2023-11-06 22:30:00,659 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 16 mSDsluCounter, 7543 mSDsCounter, 0 mSdLazyCounter, 6756 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 7706 SdHoareTripleChecker+Invalid, 6757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:00,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 7706 Invalid, 6757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6756 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-06 22:30:00,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:30:00,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:30:00,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:30:00,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:30:00,660 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 299 [2023-11-06 22:30:00,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:00,660 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:30:00,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 5.75) internal successors, (299), 52 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:30:00,660 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:30:00,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:30:00,663 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (167 of 168 remaining) [2023-11-06 22:30:00,663 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (166 of 168 remaining) [2023-11-06 22:30:00,664 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (165 of 168 remaining) [2023-11-06 22:30:00,664 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (164 of 168 remaining) [2023-11-06 22:30:00,664 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (163 of 168 remaining) [2023-11-06 22:30:00,665 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (162 of 168 remaining) [2023-11-06 22:30:00,665 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (161 of 168 remaining) [2023-11-06 22:30:00,665 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (160 of 168 remaining) [2023-11-06 22:30:00,665 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (159 of 168 remaining) [2023-11-06 22:30:00,666 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (158 of 168 remaining) [2023-11-06 22:30:00,666 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (157 of 168 remaining) [2023-11-06 22:30:00,666 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (156 of 168 remaining) [2023-11-06 22:30:00,667 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (155 of 168 remaining) [2023-11-06 22:30:00,667 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (154 of 168 remaining) [2023-11-06 22:30:00,667 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (153 of 168 remaining) [2023-11-06 22:30:00,667 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (152 of 168 remaining) [2023-11-06 22:30:00,668 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (151 of 168 remaining) [2023-11-06 22:30:00,668 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (150 of 168 remaining) [2023-11-06 22:30:00,668 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (149 of 168 remaining) [2023-11-06 22:30:00,668 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (148 of 168 remaining) [2023-11-06 22:30:00,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (147 of 168 remaining) [2023-11-06 22:30:00,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (146 of 168 remaining) [2023-11-06 22:30:00,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (145 of 168 remaining) [2023-11-06 22:30:00,670 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (144 of 168 remaining) [2023-11-06 22:30:00,670 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (143 of 168 remaining) [2023-11-06 22:30:00,670 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (142 of 168 remaining) [2023-11-06 22:30:00,670 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (141 of 168 remaining) [2023-11-06 22:30:00,671 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (140 of 168 remaining) [2023-11-06 22:30:00,671 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (139 of 168 remaining) [2023-11-06 22:30:00,671 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (138 of 168 remaining) [2023-11-06 22:30:00,671 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (137 of 168 remaining) [2023-11-06 22:30:00,671 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (136 of 168 remaining) [2023-11-06 22:30:00,672 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (135 of 168 remaining) [2023-11-06 22:30:00,672 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (134 of 168 remaining) [2023-11-06 22:30:00,672 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 168 remaining) [2023-11-06 22:30:00,672 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 168 remaining) [2023-11-06 22:30:00,672 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 168 remaining) [2023-11-06 22:30:00,672 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 168 remaining) [2023-11-06 22:30:00,672 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 168 remaining) [2023-11-06 22:30:00,673 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 168 remaining) [2023-11-06 22:30:00,673 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (127 of 168 remaining) [2023-11-06 22:30:00,673 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 168 remaining) [2023-11-06 22:30:00,673 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 168 remaining) [2023-11-06 22:30:00,673 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (124 of 168 remaining) [2023-11-06 22:30:00,673 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 168 remaining) [2023-11-06 22:30:00,674 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 168 remaining) [2023-11-06 22:30:00,674 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 168 remaining) [2023-11-06 22:30:00,674 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 168 remaining) [2023-11-06 22:30:00,674 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (119 of 168 remaining) [2023-11-06 22:30:00,674 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (118 of 168 remaining) [2023-11-06 22:30:00,674 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 168 remaining) [2023-11-06 22:30:00,675 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 168 remaining) [2023-11-06 22:30:00,675 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 168 remaining) [2023-11-06 22:30:00,675 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 168 remaining) [2023-11-06 22:30:00,675 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 168 remaining) [2023-11-06 22:30:00,675 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 168 remaining) [2023-11-06 22:30:00,675 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 168 remaining) [2023-11-06 22:30:00,676 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 168 remaining) [2023-11-06 22:30:00,676 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 168 remaining) [2023-11-06 22:30:00,676 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 168 remaining) [2023-11-06 22:30:00,676 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 168 remaining) [2023-11-06 22:30:00,676 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 168 remaining) [2023-11-06 22:30:00,676 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 168 remaining) [2023-11-06 22:30:00,676 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 168 remaining) [2023-11-06 22:30:00,677 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 168 remaining) [2023-11-06 22:30:00,677 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 168 remaining) [2023-11-06 22:30:00,677 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 168 remaining) [2023-11-06 22:30:00,677 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 168 remaining) [2023-11-06 22:30:00,677 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 168 remaining) [2023-11-06 22:30:00,677 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 168 remaining) [2023-11-06 22:30:00,677 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 168 remaining) [2023-11-06 22:30:00,678 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 168 remaining) [2023-11-06 22:30:00,678 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 168 remaining) [2023-11-06 22:30:00,678 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 168 remaining) [2023-11-06 22:30:00,678 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 168 remaining) [2023-11-06 22:30:00,678 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 168 remaining) [2023-11-06 22:30:00,678 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 168 remaining) [2023-11-06 22:30:00,679 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 168 remaining) [2023-11-06 22:30:00,679 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 168 remaining) [2023-11-06 22:30:00,679 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 168 remaining) [2023-11-06 22:30:00,679 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 168 remaining) [2023-11-06 22:30:00,679 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 168 remaining) [2023-11-06 22:30:00,680 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 168 remaining) [2023-11-06 22:30:00,680 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 168 remaining) [2023-11-06 22:30:00,680 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 168 remaining) [2023-11-06 22:30:00,680 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 168 remaining) [2023-11-06 22:30:00,680 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 168 remaining) [2023-11-06 22:30:00,680 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 168 remaining) [2023-11-06 22:30:00,680 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 168 remaining) [2023-11-06 22:30:00,681 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 168 remaining) [2023-11-06 22:30:00,681 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 168 remaining) [2023-11-06 22:30:00,681 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 168 remaining) [2023-11-06 22:30:00,681 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 168 remaining) [2023-11-06 22:30:00,681 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 168 remaining) [2023-11-06 22:30:00,681 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 168 remaining) [2023-11-06 22:30:00,682 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 168 remaining) [2023-11-06 22:30:00,682 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 168 remaining) [2023-11-06 22:30:00,682 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 168 remaining) [2023-11-06 22:30:00,682 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 168 remaining) [2023-11-06 22:30:00,682 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 168 remaining) [2023-11-06 22:30:00,682 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 168 remaining) [2023-11-06 22:30:00,682 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 168 remaining) [2023-11-06 22:30:00,683 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 168 remaining) [2023-11-06 22:30:00,683 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 168 remaining) [2023-11-06 22:30:00,683 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 168 remaining) [2023-11-06 22:30:00,683 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 168 remaining) [2023-11-06 22:30:00,683 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 168 remaining) [2023-11-06 22:30:00,683 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 168 remaining) [2023-11-06 22:30:00,684 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 168 remaining) [2023-11-06 22:30:00,684 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 168 remaining) [2023-11-06 22:30:00,684 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 168 remaining) [2023-11-06 22:30:00,684 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr111REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 168 remaining) [2023-11-06 22:30:00,684 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr112REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 168 remaining) [2023-11-06 22:30:00,684 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 168 remaining) [2023-11-06 22:30:00,685 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 168 remaining) [2023-11-06 22:30:00,685 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 168 remaining) [2023-11-06 22:30:00,685 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 168 remaining) [2023-11-06 22:30:00,685 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 168 remaining) [2023-11-06 22:30:00,685 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr118REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 168 remaining) [2023-11-06 22:30:00,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr119REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 168 remaining) [2023-11-06 22:30:00,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr120REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 168 remaining) [2023-11-06 22:30:00,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr121REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 168 remaining) [2023-11-06 22:30:00,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr122REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 168 remaining) [2023-11-06 22:30:00,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr123REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 168 remaining) [2023-11-06 22:30:00,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr124REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 168 remaining) [2023-11-06 22:30:00,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr125REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 168 remaining) [2023-11-06 22:30:00,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr126REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 168 remaining) [2023-11-06 22:30:00,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr127REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 168 remaining) [2023-11-06 22:30:00,688 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr128REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 168 remaining) [2023-11-06 22:30:00,688 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr129REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 168 remaining) [2023-11-06 22:30:00,688 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr130REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 168 remaining) [2023-11-06 22:30:00,688 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr131REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 168 remaining) [2023-11-06 22:30:00,689 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr132REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 168 remaining) [2023-11-06 22:30:00,689 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr133REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 168 remaining) [2023-11-06 22:30:00,689 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr134REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 168 remaining) [2023-11-06 22:30:00,689 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr135REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 168 remaining) [2023-11-06 22:30:00,689 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr136REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 168 remaining) [2023-11-06 22:30:00,690 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 168 remaining) [2023-11-06 22:30:00,690 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr138REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 168 remaining) [2023-11-06 22:30:00,690 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr139REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 168 remaining) [2023-11-06 22:30:00,690 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr140REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 168 remaining) [2023-11-06 22:30:00,691 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr141REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 168 remaining) [2023-11-06 22:30:00,691 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr142REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 168 remaining) [2023-11-06 22:30:00,691 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr143REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 168 remaining) [2023-11-06 22:30:00,691 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr144REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 168 remaining) [2023-11-06 22:30:00,691 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 168 remaining) [2023-11-06 22:30:00,692 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr146REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 168 remaining) [2023-11-06 22:30:00,692 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr147REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 168 remaining) [2023-11-06 22:30:00,692 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr148REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 168 remaining) [2023-11-06 22:30:00,692 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr149REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 168 remaining) [2023-11-06 22:30:00,692 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr150REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 168 remaining) [2023-11-06 22:30:00,693 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr151REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 168 remaining) [2023-11-06 22:30:00,693 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr152REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 168 remaining) [2023-11-06 22:30:00,693 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr153REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 168 remaining) [2023-11-06 22:30:00,693 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr154REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 168 remaining) [2023-11-06 22:30:00,694 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr155REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 168 remaining) [2023-11-06 22:30:00,694 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr156REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 168 remaining) [2023-11-06 22:30:00,694 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr157REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 168 remaining) [2023-11-06 22:30:00,694 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr158REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 168 remaining) [2023-11-06 22:30:00,694 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr159REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 168 remaining) [2023-11-06 22:30:00,695 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr160REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 168 remaining) [2023-11-06 22:30:00,695 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr161REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 168 remaining) [2023-11-06 22:30:00,695 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr162REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 168 remaining) [2023-11-06 22:30:00,695 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr163REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 168 remaining) [2023-11-06 22:30:00,695 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr164REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 168 remaining) [2023-11-06 22:30:00,696 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr165REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 168 remaining) [2023-11-06 22:30:00,696 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr166ASSERT_VIOLATIONMEMORY_LEAK (1 of 168 remaining) [2023-11-06 22:30:00,696 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr167ASSERT_VIOLATIONMEMORY_LEAK (0 of 168 remaining) [2023-11-06 22:30:00,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2023-11-06 22:30:00,700 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:30:00,703 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:30:00,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:30:00 BoogieIcfgContainer [2023-11-06 22:30:00,708 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:30:00,708 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:30:00,709 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:30:00,709 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:30:00,709 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:28:17" (3/4) ... [2023-11-06 22:30:00,711 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:30:00,765 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 210 nodes and edges [2023-11-06 22:30:00,769 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2023-11-06 22:30:00,774 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-11-06 22:30:00,778 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:30:00,783 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-06 22:30:00,787 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:30:01,229 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bff24c2-1d0b-4612-be12-829dbb06e57f/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:30:01,229 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bff24c2-1d0b-4612-be12-829dbb06e57f/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:30:01,229 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:30:01,230 INFO L158 Benchmark]: Toolchain (without parser) took 107596.21ms. Allocated memory was 163.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 129.1MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 135.4MB. Max. memory is 16.1GB. [2023-11-06 22:30:01,230 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 117.4MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:30:01,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 955.31ms. Allocated memory is still 163.6MB. Free memory was 129.1MB in the beginning and 93.0MB in the end (delta: 36.1MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2023-11-06 22:30:01,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 147.73ms. Allocated memory is still 163.6MB. Free memory was 93.0MB in the beginning and 84.2MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 22:30:01,231 INFO L158 Benchmark]: Boogie Preprocessor took 191.87ms. Allocated memory is still 163.6MB. Free memory was 84.2MB in the beginning and 125.5MB in the end (delta: -41.4MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2023-11-06 22:30:01,231 INFO L158 Benchmark]: RCFGBuilder took 2475.18ms. Allocated memory was 163.6MB in the beginning and 207.6MB in the end (delta: 44.0MB). Free memory was 125.5MB in the beginning and 80.8MB in the end (delta: 44.7MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. [2023-11-06 22:30:01,232 INFO L158 Benchmark]: TraceAbstraction took 103293.70ms. Allocated memory was 207.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 80.8MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2023-11-06 22:30:01,232 INFO L158 Benchmark]: Witness Printer took 521.07ms. Allocated memory is still 1.6GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 40.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2023-11-06 22:30:01,233 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 117.4MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 955.31ms. Allocated memory is still 163.6MB. Free memory was 129.1MB in the beginning and 93.0MB in the end (delta: 36.1MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 147.73ms. Allocated memory is still 163.6MB. Free memory was 93.0MB in the beginning and 84.2MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 191.87ms. Allocated memory is still 163.6MB. Free memory was 84.2MB in the beginning and 125.5MB in the end (delta: -41.4MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2475.18ms. Allocated memory was 163.6MB in the beginning and 207.6MB in the end (delta: 44.0MB). Free memory was 125.5MB in the beginning and 80.8MB in the end (delta: 44.7MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. * TraceAbstraction took 103293.70ms. Allocated memory was 207.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 80.8MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Witness Printer took 521.07ms. Allocated memory is still 1.6GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 40.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 4]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 130]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 471 locations, 168 error locations. Started 1 CEGAR loops. OverallTime: 103.2s, OverallIterations: 91, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 45.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44992 SdHoareTripleChecker+Valid, 39.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44992 mSDsluCounter, 48848 SdHoareTripleChecker+Invalid, 34.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26687 mSDsCounter, 1944 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35392 IncrementalHoareTripleChecker+Invalid, 37336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1944 mSolverCounterUnsat, 22161 mSDtfsCounter, 35392 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 657 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 562 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=471occurred in iteration=0, InterpolantAutomatonStates: 578, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 91 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.3s SsaConstructionTime, 5.4s SatisfiabilityAnalysisTime, 46.4s InterpolantComputationTime, 16665 NumberOfCodeBlocks, 16665 NumberOfCodeBlocksAsserted, 91 NumberOfCheckSat, 16574 ConstructedInterpolants, 0 QuantifiedInterpolants, 83761 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 91 InterpolantComputations, 91 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 168 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-06 22:30:01,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bff24c2-1d0b-4612-be12-829dbb06e57f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE